Sciweavers

1013 search results - page 148 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
SSD
2009
Springer
149views Database» more  SSD 2009»
14 years 3 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
BMCBI
2007
142views more  BMCBI 2007»
13 years 9 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
IJCV
2000
164views more  IJCV 2000»
13 years 9 months ago
Probabilistic Modeling and Recognition of 3-D Objects
This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical too...
Joachim Hornegger, Heinrich Niemann
CVPR
2011
IEEE
13 years 5 months ago
From Region Similarity to Category Discovery
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...
Carolina Galleguillos, Brian McFee, Serge Belongie...
DAGM
2011
Springer
12 years 9 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...