3082 search results - page 345 / 617 » New Bounds for the Controller Problem |
179
click to vote
PPAM
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
152
click to vote
WEBDB
2005
Springer
16 years 5 days ago
2005
Springer
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
184
click to vote
WG
2005
Springer
16 years 5 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
131
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper addresses verifying the timing of circuits containing level-sensitive latches in the presence of cross talk. We show that three consecutive periodic occurrences of the ...
200
click to vote
ICES
2001
Springer
15 years 11 months ago
2001
Springer
The usefulness of an artificial analog neural network is closely bound to its trainability. This paper introduces a new analog neural network architecture using weights determined...