Sciweavers

103 search results - page 3 / 21
» The Arithmetical Complexity of Dimension and Randomness
Sort
View
ISCAS
2007
IEEE
117views Hardware» more  ISCAS 2007»
14 years 1 months ago
Context-based Arithmetic Coding Reexamined for DCT Video Compression
—This paper presents a new context modeling technique for arithmetic coding of DCT coefficients in video compression. A key feature of the new technique is the inclusion of all p...
Li Zhang, Xiaolin Wu, Ning Zhang, Wen Gao, Qiang W...
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Eigenvalue Results for Large Scale Random Vandermonde Matrices with Unit Complex Entries
Abstract--This paper centers on the limit eigenvalue distribution for random Vandermonde matrices with unit magnitude complex entries. The phases of the entries are chosen independ...
Gabriel H. Tucci, Philip A. Whiting
JC
2006
53views more  JC 2006»
13 years 7 months ago
The randomized information complexity of elliptic PDE
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Stefan Heinrich
APAL
2004
105views more  APAL 2004»
13 years 7 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek