Sciweavers

558 search results - page 34 / 112
» Trees and Matchings
Sort
View
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
15 years 5 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden
MT
2006
106views more  MT 2006»
14 years 11 months ago
Example-based machine translation based on tree-string correspondence and statistical generation
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
Zhan-yi Liu, Haifeng Wang, Hua Wu
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
16 years 1 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
TOG
2008
103views more  TOG 2008»
14 years 11 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
ICALP
2007
Springer
15 years 6 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...