662 search results - page 52 / 133 » Cheap and Fast - But is it Good |
124
click to vote
KDD
1995
ACM
15 years 9 months ago
1995
ACM
This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal o...
177
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
159
click to vote
NIPS
2007
15 years 7 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...
171
click to vote
ESANN
2006
15 years 6 months ago
2006
Abstract. Current digital, directly mapped implementations of spiking neural networks use serial processing and parallel arithmetic. On a standard CPU, this might be the good choic...
165
click to vote
CG
2005
Springer
15 years 5 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...