Sciweavers

132 search results - page 5 / 27
» Simplices and Spectra of Graphs
Sort
View
SSD
1999
Springer
116views Database» more  SSD 1999»
13 years 11 months ago
Generalizing Graphs Using Amalgamation and Selection
This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying...
John G. Stell, Michael F. Worboys
DAGM
2007
Springer
14 years 1 months ago
Semi-supervised Tumor Detection in Magnetic Resonance Spectroscopic Images Using Discriminative Random Fields
Magnetic resonance spectral images provide information on metabolic processes and can thus be used for in vivo tumor diagnosis. However, each single spectrum has to be checked manu...
L. Görlitz, Bjoern H. Menze, M.-A. Weber, B. ...
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
14 years 28 days ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
CCCG
2010
13 years 9 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Stefan Huber, Martin Held
COLOGNETWENTE
2009
13 years 8 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
Stavros D. Nikolopoulos, Charis Papadopoulos