2957 search results - page 479 / 592 » The Complexity of Polynomial-Time Approximation |
ICB
2009
Springer
14 years 2 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
ISNN
2009
Springer
14 years 2 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
KSEM
2009
Springer
14 years 2 months ago
2009
Springer
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
MIG
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Despite the large success of games grounded on movement-based interactions the current state of full body motion capture technologies still prevents the exploitation of p...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...