Sciweavers

1205 search results - page 117 / 241
» On P Systems with Bounded Parallelism
Sort
View
SPAA
1998
ACM
14 years 2 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
DBISP2P
2003
Springer
79views Database» more  DBISP2P 2003»
14 years 3 months ago
SIL: Modeling and Measuring Scalable Peer-to-Peer Search Networks
The popularity of peer-to-peer search networks continues to grow, even as the limitations to the scalability of existing systems become apparent. We propose a simple model for sear...
Brian F. Cooper, Hector Garcia-Molina
TSP
2010
13 years 5 months ago
On the optimal performance in asymmetric gaussian wireless sensor networks with fading
We study the estimation of a Gaussian source by a Gaussian wireless sensor network (WSN) where L distributed sensors transmit noisy observations of the source through a fading Gau...
Hamid Behroozi, Fady Alajaji, Tamás Linder
WOMPAT
2001
Springer
14 years 2 months ago
CableS : Thread Control and Memory System Extensions for Shared Virtual Memory Clusters
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
Peter Jamieson, Angelos Bilas
PARLE
1994
14 years 2 months ago
Using Reference Counters in Update-Based Coherent Memory
Abstract. As the disparity between processor and memory speed continues to widen, the exploitation of locality of reference in shared-memory multiprocessors becomes an increasingly...
Evangelos P. Markatos, Catherine E. Chronaki