220 search results - page 11 / 44 » Copositivity tests based on the linear complementarity probl... |
105
Voted
MP
2006
15 years 11 days ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
101
Voted
JOLLI
2007
15 years 9 days ago
2007
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
122
Voted
FGR
2008
IEEE
15 years 6 months ago
2008
IEEE
Partial occlusions in face images pose a great problem for most face recognition algorithms. Several solutions to this problem have been proposed over the years – ranging from d...
117
Voted
KDD
2005
ACM
16 years 25 days ago
2005
ACM
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
88
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...