Sciweavers

406 search results - page 27 / 82
» Database-friendly random projections
Sort
View
EUROCRYPT
2004
Springer
14 years 1 months ago
Projective Coordinates Leak
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
David Naccache, Nigel P. Smart, Jacques Stern
CVPR
2010
IEEE
13 years 9 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 29 days ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
ICPR
2010
IEEE
13 years 4 months ago
Beyond "Near Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 2 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport