Sciweavers

5785 search results - page 268 / 1157
» Approximability of Probability Distributions
Sort
View
EATCS
1998
250views more  EATCS 1998»
15 years 4 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
PODS
2009
ACM
110views Database» more  PODS 2009»
16 years 5 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
147
Voted
ICASSP
2008
IEEE
15 years 11 months ago
Stability analysis of the consensus-based distributed LMS algorithm
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
Ioannis D. Schizas, Gonzalo Mateos, Georgios B. Gi...
143
Voted
CD
2005
Springer
15 years 10 months ago
A Decentralized Redeployment Algorithm for Improving the Availability of Distributed Systems
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
Sam Malek, Marija Mikic-Rakic, Nenad Medvidovic
125
Voted
PADS
1999
ACM
15 years 9 months ago
Exploiting Temporal Uncertainty in Parallel and Distributed Simulations
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
Richard Fujimoto