2107 search results - page 186 / 422 » Computing Small Search Numbers in Linear Time |
128
click to vote
TJS
2002
15 years 3 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
121
click to vote
IMR
1999
Springer
15 years 8 months ago
1999
Springer
In computational simulation of coupled, multicomponent systems, it is frequently necessary to transfer data between meshes that may di er in resolution, structure, and discretizat...
165
click to vote
MSWIM
2006
ACM
15 years 9 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
117
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
124
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...