Sciweavers

1141 search results - page 124 / 229
» Gray Code Compression
Sort
View
DCC
1995
IEEE
14 years 1 months ago
Quantization of Overcomplete Expansions
The use of overcomplete sets of vectors (redundant bases or frames) together with quantization is explored as an alternative to transform coding for signal compression. The goal i...
Vivek K. Goyal, Martin Vetterli, Nguyen T. Thao
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
14 years 4 months ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes
GECCO
2004
Springer
14 years 3 months ago
Improving the Locality Properties of Binary Representations
Abstract. Choosing representations and operators that preserve locality between genotype and phenotype space is an important goal in EA design. In the GA literature there has been ...
Adrian Grajdeanu, Kenneth A. De Jong
DCC
1999
IEEE
14 years 2 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 10 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson