202 search results - page 18 / 41 » Performance-Driven Partitioning Using a Replication Graph Ap... |
142
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
128
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
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...
136
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: Efficient information sharing is very important for emergency and rescue operations. These operations often have to be performed in environments where no communication infrastruc...
167
click to vote
MLMTA
2007
15 years 5 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
125
click to vote
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
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...