64 search results - page 12 / 13 » Frequent Subgraph Retrieval in Geometric Graph Databases |
IWCIA
2009
Springer
14 years 27 days ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
CIKM
2004
Springer
13 years 11 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
CIKM
2009
Springer
14 years 28 days ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
VIS
2005
IEEE
14 years 7 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
SC
2009
ACM
14 years 1 months ago
2009
ACM
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...