4378 search results - page 43 / 876 » On the Complexity of Ordered Colourings |
SIAMJO
2008
13 years 8 months ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
TSP
2008
13 years 8 months ago
2008
A new family of methods, named phase estimation using polyspectrum slices (PEP), for the reconstruction of the Fourier phase of a complex linear time invariant (LTI) system excited...
FMSD
2002
13 years 8 months ago
2002
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
ASWC
2009
Springer
14 years 5 days ago
2009
Springer
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...