7930 search results - page 517 / 1586 » Greedy in Approximation Algorithms |
196
click to vote
IJSNET
2007
15 years 7 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
170
click to vote
TC
2008
15 years 7 months ago
2008
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
199
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
326
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
309
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...