Sciweavers

17 search results - page 2 / 4
» Large number of queues in tandem: Scaling properties under b...
Sort
View
ISPDC
2010
IEEE
13 years 3 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
ICML
2000
IEEE
14 years 6 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
HYBRID
2010
Springer
13 years 3 months ago
Oscillation analysis of linearly coupled piecewise affine systems
In recent years, there have been intensive theoretical research works on modeling/analysis of oscillatory phenomena. In this paper, we derive a sufficient condition under which (a...
Kenji Kashima, Yasuyuki Kawamura, Jun-ichi Imura
JDA
2006
184views more  JDA 2006»
13 years 5 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 9 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali