6575 search results - page 1104 / 1315 » Specializing visualization algorithms |
122
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
129
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
130
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
123
click to vote
SODA
2007
ACM
15 years 3 months ago
2007
ACM
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
108
Voted
AAAI
2004
15 years 3 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...