1385 search results - page 113 / 277 » Clustering by Random Projections |
188
click to vote
NIPS
2004
15 years 8 months ago
2004
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
173
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
170
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
185
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Matching near-infrared (NIR) face images to visible light (VIS) face images offers a robust approach to face recognition with unconstrained illumination. In this paper we propose ...
209
click to vote
IEEECGIV
2009
IEEE
16 years 1 months ago
2009
IEEE
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...