4110 search results - page 264 / 822 » Efficient algorithms for the 2-gathering problem |
198
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
189
click to vote
PPL
2010
15 years 1 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
162
click to vote
SAC
2005
ACM
16 years 5 days ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
151
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
165
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...