3690 search results - page 138 / 738 » Computation with classical sequents |
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
This paper develops a supervised dimensionality reduction method, Lorentzian Discriminant Projection (LDP), for discriminant analysis and classification. Our method represents the...
WG
2009
Springer
15 years 4 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we propose a novel semi-supervised algorithm, which works under a two-view setting. Our algorithm, named Kernel Canonical Component Analysis Graph (KC-GRAPH), can e...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
The class imbalance is a critical problem in classification tasks related to many real world applications. A large number of solutions were proposed in literature, both at the al...