2570 search results - page 119 / 514 » Fast Algorithms For The Computation Of Ranklets |
98
Voted
CVPR
2000
IEEE
16 years 6 days ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
CVPR
2010
IEEE
14 years 10 months ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
COMPGEOM
2005
ACM
15 years 4 days ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
DCOSS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
CLA
2004
14 years 11 months ago
2004
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...