Sciweavers

927 search results - page 16 / 186
» Stability of k -Means Clustering
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 6 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
MST
2010
98views more  MST 2010»
13 years 6 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
14 years 1 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
SAC
2005
ACM
14 years 1 months ago
Finding saddle points using stability boundaries
The task of finding saddle points on potential energy surfaces plays a crucial role in understanding the dynamics of a micro-molecule as well as in studying the folding pathways ...
Chandan K. Reddy, Hsiao-Dong Chiang
CDC
2009
IEEE
153views Control Systems» more  CDC 2009»
14 years 21 days ago
Compositional stability analysis based on dual decomposition
— We propose a compositional stability analysis methodology for verifying properties of systems that are interconnections of multiple subsystems. The proposed method assembles st...
Ufuk Topcu, Andrew K. Packard, Richard M. Murray