Sciweavers

9842 search results - page 1729 / 1969
» Compositional timing analysis
Sort
View
PAM
2010
Springer
15 years 10 months ago
Network DVR: A Programmable Framework for Application-Aware Trace Collection
Network traces are essential for a wide range of network applications, including traffic analysis, network measurement, performance monitoring, and security analysis. Existing cap...
Chia-Wei Chang, Alexandre Gerber, Bill Lin, Subhab...
131
Voted
PODC
2009
ACM
15 years 10 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
114
Voted
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 10 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
117
Voted
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 10 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
121
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
« Prev « First page 1729 / 1969 Last » Next »