459 search results - page 60 / 92 » Computational Complexity of Probabilistic Disambiguation |
NIPS
2001
15 years 1 months ago
2001
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
101
click to vote
AI
2008
Springer
14 years 12 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
103
click to vote
IJPRAI
2000
14 years 11 months ago
2000
As Bayesian networks become widely accepted as a normative formalism for diagnosis based on probabilistic knowledge, they are applied to increasingly larger problem domains. These...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
201
click to vote
ICC
2011
IEEE
13 years 11 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...