Sciweavers

12659 search results - page 249 / 2532
» The distributed breakout algorithms
Sort
View
IPPS
2003
IEEE
15 years 12 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
ICDCS
1997
IEEE
15 years 11 months ago
Concurrency Control and View Notification Algorithms for Collaborative Replicated Objects
—This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objec...
Robert E. Strom, Guruduth Banavar, Kevan Miller, A...
191
Voted
CVPR
2009
IEEE
17 years 1 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
16 years 8 months ago
Conquering the Divide: Continuous Clustering of Distributed Data Streams
Data is often collected over a distributed network, but in many cases, is so voluminous that it is impractical and undesirable to collect it in a central location. Instead, we mus...
Graham Cormode, S. Muthukrishnan, Wei Zhuang
ATAL
2005
Springer
16 years 7 days ago
Towards a theory of "local to global" in distributed multi-agent systems (I)
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
Daniel Yamins