141 search results - page 25 / 29 » Approximate algorithms for credal networks with binary varia... |
BMCBI
2010
13 years 8 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose a simple and energy efficient distributed Change Detection scheme for sensor networks based on Page’s parametric CUSUM algorithm. The sensor observations are IID ove...
KDD
2004
ACM
14 years 2 months ago
2004
ACM
Mark-recapture models have for many years been used to estimate the unknown sizes of animal and bird populations. In this article we adapt a finite mixture mark-recapture model i...