2107 search results - page 63 / 422 » Computing Small Search Numbers in Linear Time |
103
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Online boosting methods have recently been used successfully for tracking, background subtraction etc. Conventional online boosting algorithms emphasize on interchanging new weak ...
127
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
110
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
108
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
112
Voted
ICIP
1995
IEEE
15 years 6 months ago
1995
IEEE
Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching crite...