Sciweavers

1075 search results - page 91 / 215
» Communities Detection in Large Networks
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
14 years 11 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ISPA
2004
Springer
15 years 3 months ago
A Congestion-Aware Search Protocol for Unstructured Peer-to-Peer Networks
Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the sca...
Kin Wah Kwong, Danny H. K. Tsang
P2P
2010
IEEE
189views Communications» more  P2P 2010»
14 years 8 months ago
Analyzing the DC File Sharing Network
—This paper investigates the Direct Connect (DC) file sharing network, which to the best of our knowledge, has never been academically studied before. We developed a participati...
Pavel Gurvich, Noam Koenigstein, Yuval Shavitt
EUROSSC
2009
Springer
15 years 2 months ago
Wireless Sensor Networks to Enable the Passive House - Deployment Experiences
Finding solutions for the current period of climate change or “global warming” is possibly the most serious and pressing challenge faced by scientists and the wider community t...
Tessa Daniel, Elena I. Gaura, James Brusey
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 5 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii