Sciweavers

36781 search results - page 144 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CISS
2008
IEEE
14 years 5 months ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan
ICCV
2009
IEEE
15 years 3 months ago
Least-Squares Congealing for Large Numbers of Images
In this paper we pursue the task of aligning an ensemble of images in an unsupervised manner. This task has been commonly referred to as “congealing” in literature. A form o...
Mark Cox, Sridha Sridharan, Simon Lucey, Jeffrey C...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 11 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
IEEEIAS
2007
IEEE
14 years 5 months ago
An LSB Data Hiding Technique Using Prime Numbers
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1]. First we mathematically m...
Sandipan Dey, Ajith Abraham, Sugata Sanyal
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
14 years 4 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama