Sciweavers

354 search results - page 24 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
DKE
2006
83views more  DKE 2006»
15 years 3 months ago
Bulk insertion for R-trees by seeded clustering
We propose a scalable technique called Seeded Clustering that allows us to maintain R-tree indices by bulk insertion while keeping pace with high data arrival rates. Our approach ...
Taewon Lee, Bongki Moon, Sukho Lee
122
Voted
JMLR
2008
83views more  JMLR 2008»
15 years 3 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
CLUSTER
2006
IEEE
15 years 9 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
157
Voted
IPPS
2003
IEEE
15 years 8 months ago
Gene Clustering Using Self-Organizing Maps and Particle Swarm Optimization
Gene clustering, the process of grouping related genes in the same cluster, is at the foundation of different genomic studies that aim at analyzing the function of genes. Microarr...
Xiang Xiao, Ernst R. Dow, Russell C. Eberhart, Zin...
ICCV
2011
IEEE
14 years 3 months ago
Imaging via Three-dimensional Compressive Sampling
Compressive sampling (CS) aims at acquiring a signal at a sampling rate that is significantly below the Nyquist rate. Its main idea is that a signal can be decoded from incomplet...
Xianbiao Shu, Narendra Ahuja