307 search results - page 20 / 62 » Low-Distortion Embeddings of Trees |
ACL
1997
13 years 9 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we study the buffered clock tree synthesis problem under thermal variations for 3D IC technology. Our major contribution is the Balanced Skew Theorem, which provides...
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...