1595 search results - page 203 / 319 » A hierarchical clustering algorithm based on the Hungarian m... |
156
click to vote
JUCS
2008
15 years 6 months ago
2008
Abstract: The thematic text segmentation task consists in identifying the most important thematic breaks in a document in order to cut it into homogeneous passages. We propose in t...
168
click to vote
GLVLSI
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
188
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
157
click to vote
PKDD
1999
Springer
15 years 10 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
183
click to vote
SAC
2005
ACM
15 years 12 months ago
2005
ACM
In this paper we present an investigation into the run-time behaviour of objects in Java programs, using specially adapted coupling metrics. We identify objects from the same clas...