3475 search results - page 40 / 695 » Backbones in Optimization and Approximation |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
ESA
2004
Springer
14 years 1 months ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
STACS
2010
Springer
14 years 25 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
DIS
1999
Springer
14 years 14 hour ago
1999
Springer