Sciweavers

494 search results - page 37 / 99
» Heap Building Bounds
Sort
View
ICPR
2010
IEEE
14 years 11 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
74
Voted
DM
2006
91views more  DM 2006»
14 years 11 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
DAM
2007
60views more  DAM 2007»
14 years 11 months ago
Restricting SBH ambiguity via restriction enzymes
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
Steven Skiena, Sagi Snir
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 10 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
ICASSP
2011
IEEE
14 years 2 months ago
PAC-Bayesian approach for minimization of phoneme error rate
We describe a new approach for phoneme recognition which aims at minimizing the phoneme error rate. Building on structured prediction techniques, we formulate the phoneme recogniz...
Joseph Keshet, David A. McAllester, Tamir Hazan