153 search results - page 22 / 31 » Near-linear approximation algorithms for geometric hitting s... |
135
Voted
MOBIHOC
2010
ACM
15 years 1 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
135
Voted
SODA
2007
ACM
15 years 5 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
149
click to vote
GIS
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
128
Voted
SIGGRAPH
2010
ACM
15 years 8 months ago
2010
ACM
Paper architectures are 3D paper buildings created by folding and cutting. The creation process of paper architecture is often laborintensive and highly skill-demanding, even with...
118
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...