2949 search results - page 214 / 590 » Universal Sparse Modeling |
134
Voted
SDM
2003
SIAM
15 years 4 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
145
click to vote
PAMI
2006
15 years 3 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
161
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. However, LDA does not ca...
107
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
141
click to vote
CIBCB
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...