395 search results - page 34 / 79 » Positive Versions of Polynomial Time |
129
click to vote
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
ALT
2003
Springer
15 years 1 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
MOR
2002
14 years 9 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Machining time is a major performance criterion when it comes to high speed machining. CAM software can help in estimating that time for a given strategy. But in practice, CAM pro...