7930 search results - page 304 / 1586 » Greedy in Approximation Algorithms |
165
click to vote
IDA
2003
Springer
15 years 12 months ago
2003
Springer
In sequential prediction tasks, one repeatedly tries to predict the next element in a sequence. A classical way to solve these problems is to fit an order-n Markov model to the da...
175
click to vote
NIPS
2007
15 years 8 months ago
2007
We show how to use unlabeled data and a deep belief net (DBN) to learn a good covariance kernel for a Gaussian process. We first learn a deep generative model of the unlabeled da...
150
click to vote
NIPS
2007
15 years 8 months ago
2007
We introduce a new Bayesian model for hierarchical clustering based on a prior over trees called Kingman’s coalescent. We develop novel greedy and sequential Monte Carlo inferen...
151
click to vote
DM
2010
15 years 6 months ago
2010
We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the max...
177
click to vote
CACM
2002
15 years 6 months ago
2002
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...