855 search results - page 13 / 171 » Complexity of Equations over Sets of Natural Numbers |
266
click to vote
Publication
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...
NN
2006
Springer
14 years 9 months ago
2006
Springer
Modular model is a particular type of committee machine and is comprised of a set of specialized (local) models each of which is responsible for a particular region of the input s...
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
104
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...