Sciweavers

824 search results - page 18 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Beyond sliding windows: Object localization by efficient subwindow search
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 8 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
ICPR
2002
IEEE
14 years 9 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
CVPR
2009
IEEE
13 years 11 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum
WCRE
1999
IEEE
14 years 2 days ago
MoJo: A Distance Metric for Software Clusterings
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
Vassilios Tzerpos, Richard C. Holt