Sciweavers

227 search results - page 35 / 46
» Approximation of the Quadratic Set Covering problem
Sort
View
ALGOSENSORS
2007
Springer
13 years 11 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
AAMAS
2007
Springer
14 years 1 months ago
Optimal Control in Large Stochastic Multi-agent Systems
Abstract. We study optimal control in large stochastic multi-agent systems in continuous space and time. We consider multi-agent systems where agents have independent dynamics with...
Bart van den Broek, Wim Wiegerinck, Bert Kappen
CVPR
2012
IEEE
11 years 9 months ago
Real time robust L1 tracker using accelerated proximal gradient approach
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
Chenglong Bao, Yi Wu, Haibin Ling, Hui Ji
FOCS
2004
IEEE
13 years 11 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy