Sciweavers

7930 search results - page 661 / 1586
» Greedy in Approximation Algorithms
Sort
View
216
Voted
ICNP
2007
IEEE
16 years 1 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...
203
Voted
ICCV
2005
IEEE
16 years 9 months ago
On-Line Density-Based Appearance Modeling for Object Tracking
Object tracking is a challenging problems in real-time computer vision due to variations of lighting condition, pose, scale, and view-point over time. However, it is exceptionally...
Bohyung Han, Larry S. Davis
215
Voted
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
16 years 7 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
217
Voted
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
16 years 1 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
180
Voted
FSTTCS
2009
Springer
16 years 1 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi