46 search results - page 9 / 10 » A Preemptive Algorithm for Maximizing Disjoint Paths on Tree... |
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ICCV
2011
IEEE
12 years 6 months ago
2011
IEEE
In this paper, we propose a long-term motion model for visual object tracking. In crowded street scenes, persistent occlusions are a frequent challenge for tracking algorithm and ...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
ICDCS
2008
IEEE
14 years 21 days ago
2008
IEEE
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. A...