Sciweavers

502 search results - page 74 / 101
» Sparse Subspace Clustering
Sort
View
MST
2010
98views more  MST 2010»
14 years 10 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...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
15 years 6 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
SMC
2007
IEEE
132views Control Systems» more  SMC 2007»
15 years 6 months ago
Disaster management model based on Modified Fuzzy Cognitive Maps
-This paper describes the use of a Fuzzy Cognitive Map (FCM) to model disaster reconstruction, based on data collected from the cities of BAM and Baravat. The extended fuzzy cognit...
Sandeep Chandana, Henry Leung, Jason Levy
ER
2004
Springer
103views Database» more  ER 2004»
15 years 5 months ago
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Julien Velcin, Jean-Gabriel Ganascia
CVPR
2008
IEEE
15 years 6 months ago
Modeling the structure of multivariate manifolds: Shape maps
We propose a shape population metric that reflects the interdependencies between points observed in a set of examples. It provides a notion of topology for shape and appearance m...
Georg Langs, Nikos Paragios