Sciweavers

1167 search results - page 125 / 234
» Limits of Spectral Clustering
Sort
View
PDPTA
2007
15 years 2 months ago
Multiple Networks for Heterogeneous Distributed Applications
Abstract - We have experienced in our distributed applications that the network is the main limiting factor for performances on clusters. Indeed clusters are cheap and it is easier...
Sylvain Jubertie, Emmanuel Melin
UAI
2008
15 years 2 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
106
Voted
CLUSTER
1999
IEEE
15 years 14 days ago
Simulative performance analysis of gossip failure detection for scalable distributed systems
Three protocols for gossip-based failure detection services in large-scale heterogeneous clusters are analyzed and compared. The basic gossip protocol provides a means by which fai...
Mark W. Burns, Alan D. George, Bradley A. Wallace
119
Voted
PR
2008
170views more  PR 2008»
15 years 8 days ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ECS
2006
89views more  ECS 2006»
15 years 24 days ago
Dynamic Decision Protocol For Adhoc Network
Several researches were conducted to Ad Hoc networks because of their facility of deployment, no need of an infrastructure and many other features. Thus, they still present many un...
Mohamed Ben Othman