Sciweavers

490 search results - page 41 / 98
» Abstraction Augmented Markov Models
Sort
View
SSS
2009
Springer
15 years 8 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
IDA
1999
Springer
15 years 6 months ago
Discovering Dynamics Using Bayesian Clustering
Abstract. This paper introduces a Bayesian method for clustering dynamic processes and applies it to the characterization of the dynamics of a military scenario. The method models ...
Paola Sebastiani, Marco Ramoni, Paul R. Cohen, Joh...
ACCV
2006
Springer
15 years 8 months ago
Smooth Foreground-Background Segmentation for Video Processing
Abstract. We propose an efficient way to account for spatial smoothness in foreground-background segmentation of video sequences. Most statistical background modeling techniques re...
Konrad Schindler, Hanzi Wang
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 2 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
TWC
2011
291views more  TWC 2011»
14 years 9 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...