Sciweavers

142 search results - page 9 / 29
» Approximation and limiting behavior of random models
Sort
View
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 25 days ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
BIOSYSTEMS
2008
102views more  BIOSYSTEMS 2008»
13 years 7 months ago
A computational model for telomere-dependent cell-replicative aging
Telomere shortening provides a molecular basis for the Hayflick limit. Recent data suggest that telomere shortening also influence mitotic rate. We propose a stochastic growth mod...
R. D. Portugal, M. G. P. Land, Benar Fux Svaiter
WSC
2004
13 years 8 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
IWCMC
2010
ACM
13 years 9 months ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton