1092 search results - page 72 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
275
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
174
click to vote
SARA
2009
Springer
16 years 13 days ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
139
click to vote
ICCV
2003
IEEE
16 years 7 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 ...
172
click to vote
ISSAC
1995
Springer
15 years 9 months ago
1995
Springer
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
162
click to vote
AAAI
2006
15 years 7 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...