Sciweavers

102291 search results - page 19685 / 20459
» Computing
Sort
View
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
16 years 19 days ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
16 years 19 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
EUC
2005
Springer
16 years 19 days ago
Asymmetry-Aware Link Quality Services in Wireless Sensor Networks
Recent studies in wireless sensor networks (WSN) have observed that the irregular link quality is a common phenomenon, rather than an anomaly. The irregular link quality, especiall...
Junzhao Du, Weisong Shi, Kewei Sha
EUC
2005
Springer
16 years 19 days ago
Coverage-Aware Sensor Engagement in Dense Sensor Networks
Wireless sensor networks are capable of carrying out surveillance missions for various applications in remote areas without human interventions. An essential issue of sensor netwo...
Jun Lu, Lichun Bao, Tatsuya Suda
EUROCRYPT
2005
Springer
16 years 19 days ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
« Prev « First page 19685 / 20459 Last » Next »