Sciweavers

314 search results - page 20 / 63
» Arithmetic Coding Revisited
Sort
View
SP
2010
IEEE
204views Security Privacy» more  SP 2010»
14 years 4 months ago
Acceleration of a CFD code with a GPU
The Computational Fluid Dynamics code Overflow includes as one of its solver options an algorithm which is a fairly small piece of code but which accounts for a significant portio...
Dennis C. Jespersen
DLT
2001
14 years 11 months ago
Context-Free Valence Grammars - Revisited
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
Hendrik Jan Hoogeboom
SGP
2007
15 years 6 days ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
ICIP
1997
IEEE
15 years 11 months ago
Binary Shape Coding Using 1-D Distance Values from Baseline
Here we describe a baseline-based binary shape coding method in which arbitrarily shaped object is represented by the traced 1-D data from baseline and turning point (TP). The sha...
Shi Hwa Lee, Dae-Sung Cho, Yu-Shin Cho, Sehoon Son...
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 10 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau