Sciweavers

817 search results - page 16 / 164
» Decoding Choice Encodings
Sort
View
AUTOMOTIVEUI
2009
ACM
14 years 4 months ago
On timing and modality choice with local danger warnings for drivers
We present an experimental study on the effectiveness of five modality variants (speech, text-only, icon-only, two combinations of text and icons) for presenting local danger wa...
Yujia Cao, Sandro Castronovo, Angela Mahr, Christi...
FOCS
1995
IEEE
14 years 1 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
COMPSYSTECH
2011
12 years 9 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos
DCC
2004
IEEE
14 years 9 months ago
Source Coding With Distortion Side Information At The Encoder
Abstract: We consider lossy source coding when side information affecting the distortion measure may be available at the encoder, decoder, both, or neither. For example, such disto...
Emin Martinian, Gregory W. Wornell, Ram Zamir
GLVLSI
1998
IEEE
122views VLSI» more  GLVLSI 1998»
14 years 2 months ago
Reducing Power Consumption of Dedicated Processors Through Instruction Set Encoding
With the increased clock frequency of modern, high-performance processors over 500 MHz, in some cases, limiting the power dissipation has become the most stringent design target. ...
Luca Benini, Giovanni De Micheli, Alberto Macii, E...