1038 search results - page 50 / 208 » Space-Bounded Query Approximation |
119
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
100
click to vote
STOC
2009
ACM
16 years 12 days ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
PAMI
2011
14 years 6 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
SIGIR
1997
ACM
15 years 4 months ago
1997
ACM
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...