2107 search results - page 253 / 422 » Computing Small Search Numbers in Linear Time |
ICALP
2011
Springer
13 years 21 days ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
ADBIS
2003
Springer
14 years 2 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calcul...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
The integral image is typically used for fast integrating a function over a rectangular region in an image. We propose a method that extends the integral image to do fast integrat...