1038 search results - page 83 / 208 » Space-Bounded Query Approximation |
137
Voted
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
130
click to vote
CIA
2006
Springer
15 years 8 months ago
2006
Springer
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
143
click to vote
TOC
2010
14 years 11 months ago
2010
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
155
click to vote
BIOINFORMATICS
2011
14 years 8 months ago
2011
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
141
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...