Sciweavers

2626 search results - page 43 / 526
» The complexity of stochastic sequences
Sort
View
COLING
1996
15 years 1 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
PRIS
2001
15 years 1 months ago
Improving the Robustness of Parametric Shape Tracking with Switched Multiple Models
This paper addresses the problem of tracking objects with complex motion dynamics or shape changes. It is assumed that some of the visual features detected in the image (e.g., edg...
Jacinto C. Nascimento, Jorge S. Marques
WSC
2000
15 years 1 months ago
Simulation optimization using tabu search
Investigation of the performance and operation of complex systems in manufacturing or other environments, analytical models of these systems become very complicated. Because of th...
Berna Dengiz, Cigdem Alabas
AAAI
2012
13 years 2 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
JCB
2008
159views more  JCB 2008»
14 years 11 months ago
BayesMD: Flexible Biological Modeling for Motif Discovery
We present BayesMD, a Bayesian Motif Discovery model with several new features. Three different types of biological a priori knowledge are built into the framework in a modular fa...
Man-Hung Eric Tang, Anders Krogh, Ole Winther