5169 search results - page 161 / 1034 » Locality approximation using time |
159
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
160
click to vote
AAAI
2007
15 years 7 months ago
2007
Accurately locating users in a wireless environment is an important task for many pervasive computing and AI applications, such as activity recognition. In a WiFi environment, a m...
137
click to vote
CIKM
1997
Springer
15 years 9 months ago
1997
Springer
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
158
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
137
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—Most of the QoS routing schemes proposed so far require periodic exchange of QoS state information among routers, imposing both communication overhead on the network and...