Sciweavers

4039 search results - page 300 / 808
» A Method for Dynamic Clustering of Data
Sort
View
CVPR
2007
IEEE
16 years 28 days ago
Estimating Cluster Overlap on Manifolds and its Application to Neuropsychiatric Disorders
Although it is usually assumed in many pattern recognition problems that different patterns are distinguishable, some patterns may have inseparable overlap. For example, some faci...
Peng Wang, Christian Köhler, Ragini Verma
EUC
2006
Springer
15 years 10 months ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen
VDA
2010
185views Visualization» more  VDA 2010»
15 years 9 months ago
Visualizing multidimensional data through granularity-dependent spatialization
Spatialization is a special kind of visualization that projects multidimensional data into low-dimensional representational spaces by making use of spatial metaphors. Spatializati...
Sofia Kontaxaki, Eleni Tomai, Margarita Kokla, Mar...
NIPS
2003
15 years 8 months ago
Optimal Manifold Representation of Data: An Information Theoretic Approach
We introduce an information theoretic method for nonparametric, nonlinear dimensionality reduction, based on the infinite cluster limit of rate distortion theory. By constraining...
Denis V. Chigirev, William Bialek
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
16 years 1 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng