Sciweavers

730 search results - page 67 / 146
» Faster dimension reduction
Sort
View
FOCS
2004
IEEE
14 years 15 days ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
AAAI
2010
13 years 10 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
ICIP
2010
IEEE
13 years 6 months ago
Randomly driven fuzzy key extraction of unclonable images
In this paper, we develop an adjustable Fuzzy Extractor using the Physical Unclonable Functions (PUF) obtained by a common laser engraving method to sign physical objects. In part...
Saloomeh Shariati, Laurent Jacques, Françoi...
TVLSI
2010
13 years 3 months ago
Pattern Sensitive Placement Perturbation for Manufacturability
The gap between VLSI technology and fabrication technology leads to strong refractive effects in lithography. Consequently, it is a huge challenge to reliably print layout features...
Shiyan Hu, Patrik Shah, Jiang Hu
DAC
2005
ACM
14 years 9 months ago
High performance computing on fault-prone nanotechnologies: novel microarchitecture techniques exploiting reliability-delay trad
Device and interconnect fabrics at the nanoscale will have a density of defects and susceptibility to transient faults far exceeding those of current silicon technologies. In this...
Andrey V. Zykov, Elias Mizan, Margarida F. Jacome,...