520 search results - page 97 / 104 » Reductions Between Expansion Problems |
140
click to vote
MOBISYS
2007
ACM
16 years 4 months ago
2007
ACM
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
187
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
139
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
— BLAST is a very popular Computational Biology algorithm. Since it is computationally expensive it is a natural target for acceleration research, and many reconfigurable archite...
175
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent tra...
134
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...