Sciweavers

3227 search results - page 38 / 646
» Designing with Distance Fields
Sort
View
FOCS
1999
IEEE
14 years 1 days ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
TCAD
2002
106views more  TCAD 2002»
13 years 7 months ago
Design of hierarchical cellular automata for on-chip test pattern generator
This paper introduces the concept of hierarchical cellular automata (HCA). The theory of HCA is developed over the Galois extension field (2 ), where each cell of the CA can store ...
Biplab K. Sikdar, Niloy Ganguly, Parimal Pal Chaud...
CASES
2005
ACM
13 years 9 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
CDES
2006
146views Hardware» more  CDES 2006»
13 years 9 months ago
ANN-Based Spiral Inductor Parameter Extraction and Layout Re-Design
A neural network approach is presented for modeling and characterization of on-chip copper spiral inductors. The approach involves the creation of neural network models to map 3D ...
Abby A. Ilumoka, Yeonbum Park
IPCC
1998
92views more  IPCC 1998»
13 years 9 months ago
Evaluating Distance Learning in Graduate Programs: Ensuring Rigorous, Rewarding Professional Education
: Internet-based distance learning programs make it possible for technical communicators located anywhere in the world to participate in graduate courses in their field. But are th...
George F. Hayhoe