Sciweavers

1982 search results - page 111 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
GRID
2006
Springer
15 years 2 months ago
Applying Peer-to-Peer Techniques to Grid Replica Location Services
Peer-to-peer systems offer attractive system management properties, including the ability of components that join the network to self-organize; scalability up to tens of thousands...
Ann L. Chervenak, Min Cai
133
Voted
DCOSS
2006
Springer
15 years 6 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
DAC
2006
ACM
16 years 3 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...
CLUSTER
2005
IEEE
15 years 8 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...