2635 search results - page 21 / 527 » Algorithms for the Database Layout Problem |
114
click to vote
COCOON
1997
Springer
15 years 6 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
143
Voted
ICDT
2007
ACM
15 years 8 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...
116
click to vote
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
196
click to vote
GIS
2008
ACM
16 years 3 months ago
2008
ACM
d Abstract] K. Buchin Dept. Computer Science Utrecht University The Netherlands buchin@cs.uu.nl M. Buchin Dept. Computer Science Utrecht University The Netherlands maike@cs.uu.nl ...
138
click to vote
JGAA
2002
15 years 2 months ago
2002
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...