Sciweavers

776 search results - page 148 / 156
» Distributed Information Regularization on Graphs
Sort
View
WWW
2011
ACM
14 years 8 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
146
Voted
IMC
2009
ACM
15 years 8 months ago
Characterizing user behavior in online social networks
Understanding how users behave when they connect to social networking sites creates opportunities for better interface design, richer studies of social interactions, and improved ...
Fabrício Benevenuto, Tiago Rodrigues, Meeyo...
ICNP
2006
IEEE
15 years 8 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
SIGMETRICS
2005
ACM
147views Hardware» more  SIGMETRICS 2005»
15 years 7 months ago
Denial-of-service resilience in peer-to-peer file sharing systems
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
Dan Dumitriu, Edward W. Knightly, Aleksandar Kuzma...
KCAP
2009
ACM
15 years 6 months ago
An entropy inspired measure for evaluating ontology modularization
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
Paul Doran, Valentina A. M. Tamma, Terry R. Payne,...