Sciweavers

2600 search results - page 99 / 520
» Clustering with or without the Approximation
Sort
View
BMCBI
2008
160views more  BMCBI 2008»
15 years 1 months ago
A comparison of four clustering methods for brain expression microarray data
Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
Alexander L. Richards, Peter Holmans, Michael C. O...
ECCV
2010
Springer
15 years 6 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
BMCBI
2006
141views more  BMCBI 2006»
15 years 1 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
DCC
2009
IEEE
16 years 2 months ago
Clustered Reversible-KLT for Progressive Lossy-to-Lossless 3d Image Coding
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
Ian Blanes, Joan Serra-Sagristà
104
Voted
SMI
2008
IEEE
108views Image Analysis» more  SMI 2008»
15 years 8 months ago
Variational Multilevel Mesh Clustering
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
Iurie Chiosa, Andreas Kolb