Sciweavers

4009 search results - page 336 / 802
» Clustering on Complex Graphs
Sort
View
JSA
2006
82views more  JSA 2006»
15 years 6 months ago
A flocking based algorithm for document clustering analysis
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
Xiaohui Cui, Jinzhu Gao, Thomas E. Potok
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
16 years 1 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
MFCS
2007
Springer
16 years 27 days ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
GD
2005
Springer
16 years 8 days ago
GEOMI: GEOmetry for Maximum Insight
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...
Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu...
VLDB
2005
ACM
82views Database» more  VLDB 2005»
16 years 7 days ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul