Sciweavers

736 search results - page 67 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
RC
2006
88views more  RC 2006»
13 years 7 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
CG
2002
Springer
13 years 7 months ago
Robust adaptive polygonal approximation of implicit curves
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
Hélio Lopes, João Batista S. de Oliv...
IPL
2007
105views more  IPL 2007»
13 years 7 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
ICPR
2004
IEEE
14 years 8 months ago
A Unification Framework for Tree and Block Wavelet Encoders
Wavelet transform coefficient encoders are broadly categorized as depending on correlations: across sub-bands through a zerotree, or within sub-bands through a block quad-tree. Th...
Andy C. Downton, Martin Fleury, Xiao Wei Yin
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 11 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...