Sciweavers

688 search results - page 37 / 138
» Types for trees
Sort
View
NAACL
2004
15 years 2 months ago
Detecting Structural Metadata with Decision Trees and Transformation-Based Learning
The regular occurrence of disfluencies is a distinguishing characteristic of spontaneous speech. Detecting and removing such disfluencies can substantially improve the usefulness ...
Joungbum Kim, Sarah E. Schwarm, Mari Ostendorf
68
Voted
CORR
2002
Springer
98views Education» more  CORR 2002»
15 years 17 days ago
Compact Floor-Planning via Orderly Spanning Trees
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for a...
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
92
Voted
ACIVS
2008
Springer
15 years 7 months ago
Parallel Algorithm for Concurrent Computation of Connected Component Tree
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
P. Matas, Eva Dokladalova, Mohamed Akil, Thierry G...
ICCV
2007
IEEE
16 years 2 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
ECML
2007
Springer
15 years 7 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski