5169 search results - page 385 / 1034 » Locality approximation using time |
173
click to vote
IJCAI
1989
15 years 8 months ago
1989
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...
189
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
196
click to vote
QOSIP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
206
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
160
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...