Sciweavers

824 search results - page 14 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
KAIS
2006
110views more  KAIS 2006»
13 years 7 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
SCALESPACE
2007
Springer
14 years 1 months ago
Paretian Similarity for Partial Comparison of Non-rigid Objects
In this paper, we address the problem of partial comparison of non-rigid objects. We introduce a new class of set-valued distances, related to the concept of Pareto optimality in e...
Alexander M. Bronstein, Michael M. Bronstein, Alfr...
SIGGRAPH
1993
ACM
13 years 12 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max
CVPR
2008
IEEE
14 years 9 months ago
Rank-based distance metric learning: An application to image retrieval
We present a novel approach to learn distance metric for information retrieval. Learning distance metric from a number of queries with side information, i.e., relevance judgements...
Jung-Eun Lee, Rong Jin, Anil K. Jain
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 26 days ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...