Sciweavers

2088 search results - page 377 / 418
» The Probabilistic Method
Sort
View
AAAI
2008
14 years 8 days ago
A Fast Data Collection and Augmentation Procedure for Object Recognition
When building an application that requires object class recognition, having enough data to learn from is critical for good performance, and can easily determine the success or fai...
Benjamin Sapp, Ashutosh Saxena, Andrew Y. Ng
NIPS
2001
13 years 11 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning
UAI
2003
13 years 11 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
BMCBI
2006
119views more  BMCBI 2006»
13 years 10 months ago
Hidden Markov Model Variants and their Application
Markov statistical methods may make it possible to develop an unsupervised learning process that can automatically identify genomic structure in prokaryotes in a comprehensive way...
Stephen Winters-Hilt
JAL
2002
113views more  JAL 2002»
13 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...