10901 search results - page 104 / 2181 » Approximations in Distributed Optimization |
156
click to vote
FOCS
2006
IEEE
16 years 13 days 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
16 years 12 days ago
2006
IEEE
144
click to vote
ESA
2004
Springer
15 years 11 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...
178
click to vote
STACS
2010
Springer
15 years 11 months 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 ...