Sciweavers

1368 search results - page 124 / 274
» Logical Hidden Markov Models
Sort
View
AMAST
2006
Springer
15 years 7 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
139
Voted
ICML
2004
IEEE
15 years 9 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
131
Voted
WWW
2009
ACM
15 years 10 months ago
Instance-based probabilistic reasoning in the semantic web
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
Pedro Oliveira, Paulo Gomes
149
Voted
CVPR
2010
IEEE
15 years 9 months ago
Towards Semantic Embedding in Visual Vocabulary
Visual vocabulary serves as a fundamental component in many computer vision tasks, such as object recognition, visual search, and scene modeling. While state-of-the-art approaches...
R.-R. Ji, Hongxun Yao, Xiaoshuai Sun
IJFCS
2008
49views more  IJFCS 2008»
15 years 3 months ago
A Markovian Approach for the Analysis of the gene Structure
Hidden Markov models (HMMs) are effective tools to detect series of statistically homogeneous structures, but they are not well suited to analyse complex structures. Numerous meth...
Christelle Melo de Lima, Laurent Gueguen, Christia...