1651 search results - page 164 / 331 » Measuring the Complexity of Classification Problems |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Bayesian analysis is a popular subspace based face recognition method. It casts the face recognition task into a binary classification problem with each of the two classes, intrap...
IWANN
2005
Springer
14 years 1 months ago
2005
Springer
A large class of problems requires real-time processing of complex temporal inputs in real-time. These are difficult tasks for state-of-the-art techniques, since they require captu...
SIAMMAX
2010
13 years 2 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
BMCBI
2010
13 years 8 months ago
2010
Background: Human Immunodeficiency Virus type 1 (HIV-1), the causative agent of Acquired Immune Deficiency Syndrome (AIDS), exhibits very high genetic diversity with different var...