5699 search results - page 12 / 1140 » Alternating model trees |
103
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
103
click to vote
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
99
Voted
EPEW
2008
Springer
15 years 2 months ago
2008
Springer
The accessible specification of performance queries is a key challenge in performance analysis. To this end, we seek to combine the intuitive aspects of natural language query spec...
102
Voted
ACL
2003
15 years 2 months ago
2003
Several approaches have been described for the automatic unsupervised acquisition of patterns for information extraction. Each approach is based on a particular model for the patt...
110
click to vote
ICCV
2001
IEEE
16 years 2 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...