Sciweavers

756 search results - page 117 / 152
» Quantization of Sparse Representations
Sort
View
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
14 years 1 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
ICMCS
2000
IEEE
113views Multimedia» more  ICMCS 2000»
14 years 3 days ago
Talking Faces
We present a method to generate mouth animations coupled with moderate movements of the head. Our method uses a coarse 2D textured mesh representation of images. With hardware tex...
Jun-yong Noh, Ulrich Neumann
ARITH
1997
IEEE
13 years 12 months ago
Theory and applications for a double-base number system
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
Vassil S. Dimitrov, Graham A. Jullien, William C. ...
ICCTA
2007
IEEE
13 years 11 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
VMV
2000
169views Visualization» more  VMV 2000»
13 years 9 months ago
A Non-Linear Subdivision Scheme for Triangle Meshes
Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be construc...
Stefan Karbacher, Stephan Seeger, Gerd Häusle...