2137 search results - page 303 / 428 » Experiments on Graph Clustering Algorithms |
113
click to vote
CORR
2009
Springer
15 years 4 days ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
119
Voted
CIKM
2004
Springer
15 years 7 months ago
2004
Springer
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
115
click to vote
ICDCS
2003
IEEE
15 years 7 months ago
2003
IEEE
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
124
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
96
Voted
VLDB
2002
ACM
15 years 2 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...