3708 search results - page 659 / 742 » Approximating Betweenness Centrality |
117
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
114
Voted
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...
106
Voted
ICIP
2002
IEEE
16 years 2 months ago
2002
IEEE
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. In this paper, we propose a numbe...
140
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
126
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...