Sciweavers

1082 search results - page 164 / 217
» Graph Mining using Graph Pattern Profiles
Sort
View
GBRPR
2009
Springer
15 years 7 months ago
From Random to Hierarchical Data through an Irregular Pyramidal Structure
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
Rimon Elias, Mohab Al Ashraf, Omar Aly
107
Voted
CCCG
2008
15 years 3 months ago
The Embroidery Problem
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
ENTCS
2008
98views more  ENTCS 2008»
15 years 2 months ago
A Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
Oana Andrei, Hélène Kirchner
CIKM
2006
Springer
15 years 6 months ago
Knowing a web page by the company it keeps
Web page classification is important to many tasks in information retrieval and web mining. However, applying traditional textual classifiers on web data often produces unsatisfyi...
Xiaoguang Qi, Brian D. Davison
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 5 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...