4378 search results - page 27 / 876 » On the Complexity of Ordered Colourings |
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di�...
ICPR
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper deals with the roles of assumption, mathematical models, and experimental control in Pattern Recognition. In order to base the discussion on actual examples, three stud...
ALGORITHMICA
2008
13 years 9 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...