5639 search results - page 1049 / 1128 » Timed Abstract Non-interference |
114
Voted
COCOA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
111
click to vote
CP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
147
click to vote
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
104
click to vote
EMMCVPR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
ESWS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This work is motivated by experiences in the course of developing an ontology-based application within a real-world setting. We found out that current benchmarks are not ...