8699 search results - page 180 / 1740 » Elements of the Theory of Computation |
161
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discon...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
CICLING
2008
Springer
15 years 1 months ago
2008
Springer
In the project we describe, we have taken a basic core of about 5000 synsets in WordNet that are the most frequently used, and we have categorized these into sixteen broad categori...