Sciweavers

1383 search results - page 3 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Down-scaling interlace video from H.264/AVC intra-coded bit stream
In this paper, we develop a method for generating thumbnail images from the interlaced H.264/AVC coded bit streams. We devise a method exploiting both the spatial and transform do...
Huy N. Tran, Hyung Suk Oh, Wonha Kim
CMA
2010
183views more  CMA 2010»
14 years 6 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
JCAM
2010
82views more  JCAM 2010»
14 years 4 months ago
Menke points on the real line and their connection to classical orthogonal polynomials
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
P. Mathur, J. S. Brauchart, Edward B. Saff
CSL
2008
Springer
14 years 11 months ago
On Counting Generalized Colorings
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
Tomer Kotek, Johann A. Makowsky, Boris Zilber
LPAR
2010
Springer
14 years 7 months ago
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
Friedrich Neurauter, Harald Zankl, Aart Middeldorp