Sciweavers

373 search results - page 40 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
DAC
1994
ACM
13 years 11 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
NECO
1998
116views more  NECO 1998»
13 years 7 months ago
GTM: The Generative Topographic Mapping
Latent variable models represent the probability density of data in a space of several dimensions in terms of a smaller number of latent, or hidden, variables. A familiar example ...
Christopher M. Bishop, Markus Svensén, Chri...
SENSYS
2004
ACM
14 years 1 months ago
MNP: multihop network reprogramming service for sensor networks
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogram...
Limin Wang
ICCV
2003
IEEE
14 years 10 months ago
Learning How to Inpaint from Global Image Statistics
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information o...
Anat Levin, Assaf Zomet, Yair Weiss
ECIR
2008
Springer
13 years 9 months ago
Semi-supervised Document Classification with a Mislabeling Error Model
Abstract. This paper investigates a new extension of the Probabilistic Latent Semantic Analysis (PLSA) model [6] for text classification where the training set is partially labeled...
Anastasia Krithara, Massih-Reza Amini, Jean-Michel...