1964 search results - page 6 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
DLOG
2008
13 years 10 months ago
2008
The development of scalable reasoning systems is one of the crucial factors determining the success of Semantic Web systems. Recently, in [GH06], an approach is proposed, which tac...
TCS
2010
13 years 2 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
CVIU
2010
13 years 7 months ago
2010
We address the problem of variational optical flow for video processing applications that need fast operation and robustness to drastic variations in illumination. Recently, a sol...