Sciweavers

235 search results - page 19 / 47
» Quantization of Discrete Probability Distributions
Sort
View
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 5 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
TIP
1998
122views more  TIP 1998»
13 years 7 months ago
An error resilient scheme for image transmission over noisy channels with memory
Abstract— This correspondence addresses the use of a joint sourcechannel coding strategy for enhancing the error resilience of images transmitted over a binary channel with addit...
Philippe Burlina, Fady Alajaji
GFKL
2005
Springer
133views Data Mining» more  GFKL 2005»
14 years 1 months ago
Finding Persisting States for Knowledge Discovery in Time Series
Abstract. Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the ...
Fabian Mörchen, Alfred Ultsch
ICIP
2002
IEEE
14 years 9 months ago
Multiresolution 3D mesh compression
In this paper, we propose an efficient low complexity compression scheme for densely sampled irregular 3D meshes. This scheme is based on 3D multiresolution analysis (3D Discrete ...
Frédéric Payan, Marc Antonini
COMPENG
2010
259views Algorithms» more  COMPENG 2010»
13 years 11 months ago
Propagation of Load Shed in Cascading Line Outages Simulated by OPA
We estimate with a branching process model the propagation of load shed and the probability distribution of load shed in simulated blackouts of an electric power system. The avera...
Janghoon Kim, Ian Dobson