Sciweavers

125 search results - page 23 / 25
» Controllable and Progressive Edge Clustering for Large Netwo...
Sort
View
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
APWEB
2010
Springer
14 years 5 days ago
Crawling Online Social Graphs
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...
Shaozhi Ye, Juan Lang, Shyhtsun Felix Wu
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
IPPS
2005
IEEE
14 years 29 days ago
Connection-less TCP
TCP is an important protocol in high-performance computing. It is used extensively in graphics programs and file systems and it is often the protocol used for the cluster control...
Patricia Gilfeather, Arthur B. Maccabe
CCR
1999
92views more  CCR 1999»
13 years 7 months ago
YESSIR: a simple reservation mechanism for the Internet
Abstract-RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message...
Ping Pan, Henning Schulzrinne