848 search results - page 20 / 170 » Randomness and the linear degrees of computability |
211
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
We present a linear approach to the 3D reconstruction problem from occluding contours using algebraic surfaces. The problem of noise and missing data in the occluding contours extr...
118
click to vote
DAC
2009
ACM
16 years 6 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
172
click to vote
WDAG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
137
click to vote
ESANN
2007
15 years 7 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
181
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...