Sciweavers

1840 search results - page 224 / 368
» time 2002
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 4 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
144
Voted
ICCD
2002
IEEE
128views Hardware» more  ICCD 2002»
16 years 2 months ago
Subword Sorting with Versatile Permutation Instructions
Subword parallelism has succeeded in accelerating many multimedia applications. Subword permutation instructions have been proposed to efficiently rearrange subwords in or among r...
Zhijie Shi, Ruby B. Lee
CADE
2002
Springer
16 years 6 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
DFT
2002
IEEE
79views VLSI» more  DFT 2002»
15 years 10 months ago
Gate-Delay Fault Diagnosis Using the Inject-and-Evaluate Paradigm
We propose an algorithm for gate-delay fault diagnosis. It is based on the inject-and-evaluate paradigm [1], in which the fault site(s) are predicted through a series of injection...
Horng-Bin Wang, Shi-Yu Huang, Jing-Reng Huang
DSD
2002
IEEE
90views Hardware» more  DSD 2002»
15 years 10 months ago
Simplifying Instruction Issue Logic in Superscalar Processors
Modern microprocessors schedule instructions dynamically in order to exploit instruction-level parallelism. It is necessary to increase instruction window size for improving instr...
Toshinori Sato, Itsujiro Arita