Sciweavers

220 search results - page 18 / 44
» Expected Sequence Similarity Maximization
Sort
View
CVPR
2000
IEEE
15 years 11 months ago
Towards Automatic Discovery of Object Categories
We propose a method to learn heterogeneous models of object classes for visual recognition. The training images contain a preponderance of clutter and learning is unsupervised. Ou...
Markus Weber, Max Welling, Pietro Perona
CVPR
2011
IEEE
14 years 5 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
MSV
2004
14 years 11 months ago
MABAC - Matrix Based Clustering Algorithm
Clustering is a prominent method in the data mining field. It is a discovery process that groups data such that intra cluster similarity is maximized and the inter cluster similar...
Yonghui Chen, Alan P. Sprague, Kevin D. Reilly
JACM
2010
135views more  JACM 2010»
14 years 8 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
TAMC
2009
Springer
15 years 4 months ago
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...
Binhai Zhu