15073 search results - page 333 / 3015 » Probabilistic algorithms for computing resultants |
143
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
146
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
We develop an algorithm for the super-resolution optical flow computation by combining variational super-resolution and the variational optical flow computation. Our method firs...
143
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
158
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
149
click to vote
AAIM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...