108 search results - page 2 / 22 » Revisiting Two Classical Results on Graph Spectra |
KBSE
2003
IEEE
13 years 11 months ago
2003
IEEE
We present a method for performing fault localization using similar program spectra. Our method assumes the existence of a faulty run and a larger number of correct runs. It then ...
ICASSP
2008
IEEE
14 years 21 days ago
2008
IEEE
A novel approach to measure the interdependence of time series is proposed, based on the alignment (“matching”) of their Huang-Hilbert spectra. The method consists of three st...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
SIAMCOMP
2011
12 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
ESORICS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...