500 search results - page 76 / 100 » Approximation algorithms for maximum independent set of pseu... |
104
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
112
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
114
Voted
KI
2007
Springer
15 years 1 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
109
click to vote
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Regeneration of biometric templates from match scores has security and privacy implications related to any biometric based authentication system. In this paper, we propose a novel...
118
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...