Sciweavers

767 search results - page 121 / 154
» On Clustering Using Random Walks
Sort
View
CLUSTER
2008
IEEE
14 years 2 months ago
High message rate, NIC-based atomics: Design and performance considerations
—Remote atomic memory operations are critical for achieving high-performance synchronization in tightly-coupled systems. Previous approaches to implementing atomic memory operati...
Keith D. Underwood, Michael Levenhagen, K. Scott H...
ICPADS
2006
IEEE
14 years 1 months ago
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the...
Jianying Zhang, Jie Wu
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 7 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
NOSSDAV
2009
Springer
14 years 2 months ago
Overlay monitoring and repair in swarm-based peer-to-peer streaming
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a ...
Nazanin Magharei, Reza Rejaie
CAAN
2004
Springer
14 years 1 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy