Sciweavers

1170 search results - page 23 / 234
» How Fast Is Too Fast
Sort
View
NIPS
2001
15 years 3 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic
FMSD
2002
114views more  FMSD 2002»
15 years 2 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
ICML
2008
IEEE
16 years 3 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
ICASSP
2008
IEEE
15 years 9 months ago
Fast automated stopping-time and edge-strength estimation for anisotropic diffusion
Anisotropic diffusion (ATD) is an edge-oriented, scale-space based, and iterative image-smoothing process. Two main challenges of ATD are how to automatically stop the iterative p...
Eva Rifkah, Aishy Amer
KDD
1997
ACM
103views Data Mining» more  KDD 1997»
15 years 6 months ago
Fast Committee Machines for Regression and Classification
In many data mining applications we are given a set of training examples and asked to construct a regression machine or a classifier that has low prediction error or low error rat...
Harris Drucker