Sciweavers

900 search results - page 138 / 180
» Metric Structures and Probabilistic Computation
Sort
View
TAPOS
1998
126views more  TAPOS 1998»
13 years 7 months ago
Design of Class Hierarchies Based on Concept (Galois) Lattices
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
Robert Godin, Hafedh Mili, Guy W. Mineau, Rokia Mi...
CVIU
2011
12 years 11 months ago
Graph attribute embedding via Riemannian submersion learning
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...
CVPR
2004
IEEE
14 years 9 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
ECCV
2008
Springer
14 years 9 months ago
Improving Shape Retrieval by Learning Graph Transduction
Abstract. Shape retrieval/matching is a very important topic in computer vision. The recent progress in this domain has been mostly driven by designing smart features for providing...
Xingwei Yang, Xiang Bai, Longin Jan Latecki, Zhuow...
ICPR
2000
IEEE
14 years 8 months ago
Winner-Update Algorithm for Nearest Neighbor Search
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh