Sciweavers

2228 search results - page 172 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 4 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 10 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
16 years 3 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
ICC
2011
IEEE
257views Communications» more  ICC 2011»
14 years 6 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
SIGMETRICS
1999
ACM
15 years 11 months ago
Availability and Utility of Idle Memory in Workstation Clusters
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...
Anurag Acharya, Sanjeev Setia