Sciweavers

78 search results - page 13 / 16
» Subquadratic Approximation Algorithms for Clustering Problem...
Sort
View
ICMCS
2006
IEEE
105views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Entropy and Memory Constrained Vector Quantization with Separability Based Feature Selection
An iterative model selection algorithm is proposed. The algorithm seeks relevant features and an optimal number of codewords (or codebook size) as part of the optimization. We use...
Sangho Yoon, Robert M. Gray
BMCBI
2008
148views more  BMCBI 2008»
13 years 7 months ago
Discovering biclusters in gene expression data based on high-dimensional linear geometries
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...
Xiangchao Gan, Alan Wee-Chung Liew, Hong Yan
AFRIGRAPH
2003
ACM
13 years 11 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 7 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
MM
2004
ACM
167views Multimedia» more  MM 2004»
14 years 25 days ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang