Sciweavers

12659 search results - page 200 / 2532
» The distributed breakout algorithms
Sort
View
NIPS
2008
15 years 6 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
149
Voted
IJCNN
2000
IEEE
15 years 9 months ago
A Constraint Learning Algorithm for Blind Source Separation
In Jutten’s blind separation algorithm, symmetrical distribution and statistical independence of the signal sources are assumed. When they are not satisfied, the learning proce...
Kenji Nakayama, Akihiro Hirano, Motoki Nitta
PODC
2010
ACM
15 years 7 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
FLAIRS
2003
15 years 6 months ago
BUC Algorithm for Iceberg Cubes: Implementation and Sensitivity Analysis
The Iceberg-Cube problem restricts the computation of the data cube to only those group-by partitions satisfying a minimum threshold condition defined on a specified measure. In t...
George E. Nasr, Celine Badr
DEBS
2003
ACM
15 years 10 months ago
Introducing reliability in content-based publish-subscribe through epidemic algorithms
Distributed content-based publish-subscribe middleware provides the necessary decoupling, flexibility, expressiveness, and scalability required by modern distributed applications...
Paolo Costa, Matteo Migliavacca, Gian Pietro Picco...