Sciweavers

801 search results - page 57 / 161
» Minimal Locked Trees
Sort
View
TCAD
2002
93views more  TCAD 2002»
15 years 6 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
ALGORITHMICA
2011
15 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
INTERSPEECH
2010
15 years 1 months ago
A discriminative splitting criterion for phonetic decision trees
Phonetic decision trees are a key concept in acoustic modeling for large vocabulary continuous speech recognition. Although discriminative training has become a major line of rese...
Simon Wiesler, Georg Heigold, Markus Nußbaum...
ACL
2004
15 years 7 months ago
Wrapping of Trees
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition t...
James Rogers
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 6 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke