1731 search results - page 82 / 347 » Maximum likelihood analysis of algorithms and data structure... |
145
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
142
click to vote
IDA
1999
Springer
15 years 8 months ago
1999
Springer
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
140
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
169
Voted
BMCBI
2006
15 years 4 months ago
2006
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...
106
click to vote
IEEEMSP
2002
IEEE
15 years 9 months ago
2002
IEEE
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...