Sciweavers

672 search results - page 129 / 135
» Almost Optimal Dispersers
Sort
View
RANDOM
1998
Springer
14 years 23 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
14 years 23 days ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
ICALP
1992
Springer
14 years 19 days ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
MICCAI
2000
Springer
14 years 4 days ago
Fixation-Based Surgery: A New Technique for Distal Radius Osteotomy
Abstract. Fixation-based surgery is a new technique for achieving difficult corrections in some orthopedic procedures. The method is premised on using a fixation device, such as a ...
H. Croitoru, Randy E. Ellis, Carolyn F. Small, Dav...
NGC
2000
Springer
125views Communications» more  NGC 2000»
14 years 4 days ago
A multicast-based protocol for IP mobility support
Several architectures have been recently proposed to support IP mobility. Most studies, however, show that current protocols, in general, fall short from satisfying the performanc...
Ahmed Helmy