Sciweavers

15033 search results - page 2620 / 3007
» Complexity Theory and Algorithms
Sort
View
172
Voted
ICML
2007
IEEE
16 years 7 months ago
On learning linear ranking functions for beam search
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...
Yuehua Xu, Alan Fern
ICML
2008
IEEE
16 years 7 months ago
On the quantitative analysis of deep belief networks
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...
Ruslan Salakhutdinov, Iain Murray
ICML
2008
IEEE
16 years 7 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
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...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
ICML
2008
IEEE
16 years 7 months ago
An HDP-HMM for systems with state persistence
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...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
ICML
2006
IEEE
16 years 7 months ago
Discriminative cluster analysis
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...
Fernando De la Torre, Takeo Kanade
« Prev « First page 2620 / 3007 Last » Next »