Sciweavers

106 search results - page 5 / 22
» The skew spectrum of graphs
Sort
View
JCISD
2002
47views more  JCISD 2002»
13 years 5 months ago
Exploring the Limits of Graph Invariant- and Spectrum-Based Discrimination of (Sub)structures
Christoph Rücker, Gerta Rücker, Markus M...
GD
2005
Springer
13 years 11 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
CVIU
2008
113views more  CVIU 2008»
13 years 5 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
ICPR
2006
IEEE
14 years 6 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
PRL
2006
89views more  PRL 2006»
13 years 5 months ago
ROC graphs with instance-varying costs
Receiver Operating Characteristics (ROC) graphs are a useful technique for organizing classifiers and visualizing their performance. ROC graphs have been used in cost-sensitive le...
Tom Fawcett