4378 search results - page 322 / 876 » On the Complexity of Ordered Colourings |
187
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
195
click to vote
AAAI
2007
15 years 9 months ago
2007
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
179
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Greek is one of the most difficult languages to handle in Web Information Retrieval (IR) related tasks. Its difficulty stems from the fact that it is grammatically, morphologicall...
154
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
157
click to vote
DAGSTUHL
2010
15 years 8 months ago
2010
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...