Sciweavers

1380 search results - page 23 / 276
» A General Polynomial Sieve
Sort
View
DLOG
2004
13 years 10 months ago
On Subsumption and Instance Problem in ELH w.r.t. General TBoxes
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
Sebastian Brandt
ICPR
2008
IEEE
14 years 3 months ago
Generalized Chebyshev Kernels for Support Vector Classification
In this paper, a method to generalize previously proposed Chebyshev Kernel function is presented for Support Vector Classification in order to obtain more robust and higher classi...
Sedat Ozer, Chi Hau Chen
ICGI
2010
Springer
13 years 9 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 8 months ago
On the structure of generalized toric codes
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric code...
Diego Ruano
ICASSP
2011
IEEE
13 years 11 days ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos