Sciweavers

963 search results - page 59 / 193
» On the decomposition of rational functions
Sort
View
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
13 years 3 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
13 years 8 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée
ICIP
2008
IEEE
14 years 3 months ago
Atomic decomposition dedicated to AVC and spatial SVC prediction
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
Aurelie Martin, Jean-Jacques Fuchs, Christine Guil...
ICMCS
2006
IEEE
140views Multimedia» more  ICMCS 2006»
14 years 2 months ago
A Fast Matching Pursuits Algorithm using Sub-Band Decomposition of Video Signals
A high-efficiency video coding method using matching pursuits, which is a waveform coding technique, has recently been proposed. In this method, the motion compensated prediction...
Kousuke Imamura, Yoshimasa Koba, Hideo Hashimoto
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...