Sciweavers

1301 search results - page 28 / 261
» Default Clustering from Sparse Data Sets
Sort
View
AFRIGRAPH
2010
ACM
14 years 16 days ago
Visualization of solution sets from automated docking of molecular structures
Aligning structures, often referred to as docking or registration, is frequently required in fields such as computer science, robotics and structural biology. The task of alignin...
Johannes Jansen van Vuuren, Michelle Kuttel, James...
SIAMSC
2008
131views more  SIAMSC 2008»
13 years 8 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
ICASSP
2010
IEEE
13 years 7 months ago
Exploring statistical properties for semantic annotation: sparse distributed and convergent assumptions for keywords
Does there exist a compact set of visual topics in form of keyword clusters capable to represent all images visual content within an acceptable error? In this paper, we answer thi...
Xianming Liu, Hongxun Yao, Rongrong Ji
SI3D
2006
ACM
14 years 2 months ago
Human motion estimation from a reduced marker set
Motion capture data from human subjects exhibits considerable redundancy. In this paper, we propose novel methods for exploiting this redundancy. In particular, we set out to find...
Guodong Liu, Jingdan Zhang, Wei Wang 0010, Leonard...
IJCAI
2007
13 years 10 months ago
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
Shehroz S. Khan, Shri Kant