195 search results - page 11 / 39 » Tractable Approximations to Robust Conic Optimization Proble... |
125
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
115
Voted
TMC
2011
14 years 10 months ago
2011
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
165
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
150
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
123
Voted
TIT
2008
15 years 3 months ago
2008
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...