4110 search results - page 601 / 822 » Efficient algorithms for the 2-gathering problem |
168
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
185
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
213
click to vote
TMC
2010
15 years 1 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
180
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
167
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...