Sciweavers

36 search results - page 6 / 8
» Algorithms for Enumerating All Perfect, Maximum and Maximal ...
Sort
View
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 2 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
NIPS
2008
13 years 9 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
DGCI
2009
Springer
13 years 11 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
14 years 2 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
ICCCN
2008
IEEE
14 years 2 months ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
Mingming Lu, Jie Wu