Sciweavers

1510 search results - page 42 / 302
» Upper Probabilities and Additivity
Sort
View
UAI
2008
14 years 12 days ago
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
Gert De Cooman, Filip Hermans, Erik Quaeghebeur
TIT
2002
120views more  TIT 2002»
13 years 10 months ago
Finite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
Changyan Di, David Proietti, Ì. Emre Telata...
INFOCOM
2003
IEEE
14 years 4 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
ISIPTA
1999
IEEE
14 years 3 months ago
Implicative Analysis for Multivariate Binary Data using an Imprecise Dirichlet Model
Bayesian implicative analysis was proposed for summarizing the association in a 22 contingency table in terms possibly asymmetrical such as, e.g., presence of feature a implies, i...
Jean-Marc Bernard
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 11 months ago
Statistical Compressive Sensing of Gaussian Mixture Models
A new framework of compressive sensing (CS), namely statistical compressive sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical dist...
Guoshen Yu, Guillermo Sapiro