Sciweavers

736 search results - page 64 / 148
» Distinguishing geometric graphs
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 8 days ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
15 years 9 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 11 months ago
Track Layouts of Graphs
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
Vida Dujmovic, Attila Pór, David R. Wood
COMPGEOM
2007
ACM
15 years 3 months ago
Embedding 3-polytopes on a small grid
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
Ares Ribó Mor, Günter Rote, Andr&eacut...
ECCV
2004
Springer
16 years 1 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...