599 search results - page 66 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
93
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
117
click to vote
TSMC
2010
14 years 4 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
103
click to vote
WADS
2007
Springer
15 years 3 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...