Sciweavers

4378 search results - page 77 / 876
» On the Complexity of Ordered Colourings
Sort
View
VLDB
2005
ACM
140views Database» more  VLDB 2005»
14 years 2 months ago
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
Marios Hadjieleftheriou, George Kollios, Petko Bak...
JSYML
2006
86views more  JSYML 2006»
13 years 9 months ago
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
William C. Calhoun
DCG
2006
68views more  DCG 2006»
13 years 9 months ago
The Stirling Polynomial of a Simplicial Complex
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
Gábor Hetyei
ER
2007
Springer
103views Database» more  ER 2007»
14 years 3 months ago
Ensuring the Semantic Correctness of Complex Regions
Ensuring the semantic and topological correctness of spatial data is an important requirement in geographical information systems and spatial database systems in order to preserve ...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
AAAI
2000
13 years 10 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val