223 search results - page 30 / 45 » Proving Termination by Bounded Increase |
AAAI
2008
14 years 11 months ago
2008
A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness ...
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
DBPL
1999
Springer
15 years 1 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
FPGA
2004
ACM
15 years 1 months ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...