Sciweavers

1434 search results - page 169 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
105
Voted
SPAA
2004
ACM
15 years 7 months ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
SPIN
2004
Springer
15 years 7 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
MM
2006
ACM
221views Multimedia» more  MM 2006»
15 years 8 months ago
Video object segmentation by motion-based sequential feature clustering
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and man...
Mei Han, Wei Xu, Yihong Gong
P2P
2008
IEEE
124views Communications» more  P2P 2008»
15 years 8 months ago
A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P-TV systems distribute live streaming contents by organizing the information flow in small chunks that are exchanged among peers. Different strategies can be implemented at th...
Ana Paula Couto da Silva, Emilio Leonardi, Marco M...
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 6 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo