4212 search results - page 57 / 843 » On Compressible Pairings and Their Computation |
122
click to vote
TCAD
1998
15 years 6 days ago
1998
We address the problem of code size minimization in VLSI systems with embedded DSP processors. Reducing code size reduces the production cost of embedded systems. We use data comp...
102
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
102
Voted
ICCSA
2007
Springer
15 years 6 months ago
2007
Springer
Deniability is defined as a privacy property which enables protocol principals to deny their involvement after they had taken part in a particular protocol run. Lately, Chou et al....
100
click to vote
ISVC
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we report a robust, efficient, and automatic method for matching infrared tracked markers for human motion analysis in computer-aided physical therapy applications. ...
144
click to vote
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...