Sciweavers

3131 search results - page 150 / 627
» Generalized connection caching
Sort
View
98
Voted
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 1 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 28 days ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
95
Voted
IMC
2003
ACM
15 years 5 months ago
Variability in TCP round-trip times
We measured and analyzed the variability in round trip times (RTTs) within TCP connections using passive measurement techniques. We collected eight hours of bidirectional traces c...
Jay Aikat, Jasleen Kaur, F. Donelson Smith, Kevin ...
POPL
2007
ACM
16 years 29 days ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
119
Voted
CBSE
2009
Springer
15 years 7 months ago
Control Encapsulation: A Calculus for Exogenous Composition of Software Components
Abstract. In current software components models, components do not encapsulate control, and are composed by connection mechanisms which pass control from component to component. Co...
Kung-Kiu Lau, Mario Ornaghi