Sciweavers

2863 search results - page 383 / 573
» Constructing minimum-interference networks
Sort
View
133
Voted
PODC
2005
ACM
15 years 9 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
125
Voted
IPTPS
2005
Springer
15 years 9 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
141
Voted
IWCMC
2010
ACM
15 years 5 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
138
Voted
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 5 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
135
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...