1632 search results - page 46 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
106
click to vote
ICPR
2006
IEEE
15 years 9 months ago
2006
IEEE
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
117
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
134
click to vote
ACIVS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The Full Search Block-Matching Motion Estimation (FSBME) algorithm is often employed in video coding for its regular dataflow and straightforward architectures. By iterat...
125
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...