Sciweavers

2814 search results - page 378 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
PODC
2006
ACM
14 years 4 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
PAMI
2006
193views more  PAMI 2006»
13 years 10 months ago
A System for Learning Statistical Motion Patterns
Analysis of motion patterns is an effective approach for anomaly detection and behavior prediction. Current approaches for the analysis of motion patterns depend on known scenes, w...
Weiming Hu, Xuejuan Xiao, Zhouyu Fu, Dan Xie, Tien...
DAC
2006
ACM
14 years 11 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
12 years 23 days ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
14 years 4 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...