1731 search results - page 85 / 347 » Maximum likelihood analysis of algorithms and data structure... |
140
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
136
click to vote
CVPR
2007
IEEE
15 years 10 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
128
Voted
WABI
2005
Springer
15 years 9 months ago
2005
Springer
We give a new algorithm for the genotype phasing problem. Our solution is based on a hidden Markov model for haplotypes. The model has a uniform structure, unlike most solutions pr...
133
click to vote
ACL
2004
15 years 5 months ago
2004
Exploiting unannotated natural language data is hard largely because unsupervised parameter estimation is hard. We describe deterministic annealing (Rose et al., 1990) as an appea...
160
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose an unsupervised inference procedure for audio source separation. Components in nonnegative matrix factorization (NMF) are grouped automatically in audio sources via a p...