Sciweavers

903 search results - page 123 / 181
» On the reduction of a random basis
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Eigenspace sparsity for compression and denoising
Sparsity in the eigenspace of signal covariance matrices is exploited in this paper for compression and denoising. Dimensionality reduction (DR) and quantization modules present i...
Ioannis D. Schizas, Georgios B. Giannakis
IACR
2011
141views more  IACR 2011»
14 years 5 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
15 years 7 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
CLUSTER
2004
IEEE
15 years 10 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
ISLPED
1995
ACM
131views Hardware» more  ISLPED 1995»
15 years 9 months ago
Guarded evaluation: pushing power management to logic synthesis/design
The need to reduce the power consumption of the next generation of digital systems is clearly recognized. At the system level, power management is a very powerful technique and de...
Vivek Tiwari, Sharad Malik, Pranav Ashar