Sciweavers

117 search results - page 7 / 24
» Scalable and fully distributed localization with mere connec...
Sort
View
ICPP
2000
IEEE
15 years 1 months ago
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
Adriana Iamnitchi, Ian T. Foster
GRID
2006
Springer
14 years 9 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui
MOBIHOC
2002
ACM
15 years 9 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
JEC
2006
100views more  JEC 2006»
14 years 9 months ago
RC-SIMD: Reconfigurable communication SIMD architecture for image processing applications
During the last two decades, Single Instruction Multiple Data (SIMD) processors have become important architectures in embedded systems for image processing applications. The main ...
Hamed Fatemi, Bart Mesman, Henk Corporaal, Twan Ba...
92
Voted
SIGIR
2010
ACM
14 years 9 months ago
Scalability of findability: effective and efficient IR operations in large information networks
It is crucial to study basic principles that support adaptive and scalable retrieval functions in large networked environments such as the Web, where information is distributed am...
Weimao Ke, Javed Mostafa