Sciweavers

1990 search results - page 396 / 398
» Optimizing the Instruction Cache Performance of the Operatin...
Sort
View
SRDS
2006
IEEE
14 years 1 months ago
MOve: Design of An Application-Malleable Overlay
Peer-to-peer overlays allow distributed applications to work in a wide-area, scalable, and fault-tolerant manner. However, most structured and unstructured overlays present in lit...
Sébastien Monnet, Ramsés Morales, Ga...
SSDBM
2003
IEEE
196views Database» more  SSDBM 2003»
14 years 23 days ago
Stream Window Join: Tracking Moving Objects in Sensor-Network Databases
The widespread use of sensor networks presents revolutionary opportunities for life and environmental science applications. Many of these applications involve continuous queries t...
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 5 months ago
Cooperative Algorithms for MIMO Interference Channels
Interference alignment is a transmission technique for exploiting all available degrees of freedom in the symmetric frequency- or time-selective interference channel with an arbit...
Steven W. Peters, Robert W. Heath Jr.
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 7 months ago
Wait-free consensus with infinite arrivals
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 ...
James Aspnes, Gauri Shah, Jatin Shah