Sciweavers

745 search results - page 70 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
SPAA
2009
ACM
15 years 7 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
101
Voted
ICPADS
2005
IEEE
15 years 6 months ago
On the Connectedness of Peer-to-Peer Overlay Networks
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
Weisheng Si, MingChu Li
AUSDM
2008
Springer
237views Data Mining» more  AUSDM 2008»
15 years 2 months ago
On Inconsistencies in Quantifying Strength of Community Structures
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
Wen Haw Chong
96
Voted
MIDDLEWARE
2004
Springer
15 years 6 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
97
Voted
ICML
2009
IEEE
16 years 1 months ago
Learning Markov logic network structure via hypergraph lifting
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
Stanley Kok, Pedro Domingos