Sciweavers

3098 search results - page 364 / 620
» On distributed smooth scheduling
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
15 years 6 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
GLOBECOM
2010
IEEE
15 years 4 months ago
Deadline-Based Differentiation in P2P Streaming
Splitting a P2P video distribution in multiple media flows with different priorities is an interesting approach for developing flexible and adaptive streaming systems, ranging from...
Csaba Király, Renato Lo Cigno, Luca Abeni
SSS
2010
Springer
125views Control Systems» more  SSS 2010»
15 years 4 months ago
Systematic Correct Construction of Self-stabilizing Systems: A Case Study
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanti...
Ananda Basu, Borzoo Bonakdarpour, Marius Bozga, Jo...
ECCV
2008
Springer
16 years 8 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson
ICPR
2008
IEEE
16 years 7 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios