Sciweavers

202 search results - page 18 / 41
» Performance-Driven Partitioning Using a Replication Graph Ap...
Sort
View
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICPR
2010
IEEE
13 years 10 months ago
Entropy Estimation and Multi-Dimensional Scale Saliency
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
Pablo Suau, Francisco Escolano
BTW
2007
Springer
189views Database» more  BTW 2007»
14 years 1 months ago
Reconsidering Consistency Management in Shared Data Spaces for Emergency and Rescue Applications
: Efficient information sharing is very important for emergency and rescue operations. These operations often have to be performed in environments where no communication infrastruc...
Thomas Plagemann, Ellen Munthe-Kaas, Vera Goebel
MLMTA
2007
13 years 9 months ago
Consensus Based Ensembles of Soft Clusterings
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
Kunal Punera, Joydeep Ghosh
DATE
2008
IEEE
114views Hardware» more  DATE 2008»
14 years 1 months ago
Synthesis of Fault-Tolerant Embedded Systems
This work addresses the issue of design optimization for faulttolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpoin...
Petru Eles, Viacheslav Izosimov, Paul Pop, Zebo Pe...