85 search results - page 11 / 17 » A DC Programming Approach for Sparse Eigenvalue Problem |
169
click to vote
CP
2009
Springer
16 years 7 days ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
91
Voted
UM
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In this paper, we address the problem of providing guidelines to designers of mixed-initiative artificial intelligence systems, which specify when the system should take...
110
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
98
Voted
IJCNN
2007
IEEE
15 years 6 months ago
2007
IEEE
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...
100
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...