10608 search results - page 1698 / 2122 » Complexity of O'Hara's Algorithm |
123
Voted
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
157
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
122
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
129
Voted
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...
151
Voted
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...