Sciweavers

2283 search results - page 313 / 457
» Bounds of Graph Characteristics
Sort
View
ETT
2006
102views Education» more  ETT 2006»
13 years 8 months ago
Bit-interleaved coded irregular modulation
We consider a simple method to improve the adaptiveness and flexibility of bit-interleaved coded modulation (BICM) for various channel models. With state-of-the art adaptive transm...
Frank Schreckenbach, Gerhard Bauch
IEICET
2007
131views more  IEICET 2007»
13 years 8 months ago
High Accuracy Fundamental Matrix Computation and Its Performance Evaluation
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
Ken-ichi Kanatani, Yasuyuki Sugaya
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 7 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
ICPR
2010
IEEE
13 years 6 months ago
Incremental Training of Multiclass Support Vector Machines
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
Symeon Nikitidis, Nikos Nikolaidis, Ioannis Pitas
JCO
2010
90views more  JCO 2010»
13 years 6 months ago
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s ...
Geng-sheng Zhang, Yu-qin Yang