Sciweavers

291 search results - page 41 / 59
» Clustering and the Biclique Partition Problem
Sort
View
ECCV
2004
Springer
14 years 11 months ago
Parallel Variational Motion Estimation by Domain Decomposition and Cluster Computing
We present an approach to parallel variational optical flow computation on standard hardware by domain decomposition. Using an arbitrary partition of the image plane into rectangul...
Timo Kohlberger, Christoph Schnörr, Andr&eacu...
ICIP
2002
IEEE
14 years 10 months ago
Boosting face recognition on a large-scale database
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...
Juwei Lu, Konstantinos N. Plataniotis
GFKL
2005
Springer
141views Data Mining» more  GFKL 2005»
14 years 2 months ago
On External Indices for Mixtures: Validating Mixtures of Genes
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
Ivan G. Costa, Alexander Schliep
EMMCVPR
1997
Springer
14 years 1 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
14 years 2 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu