Sciweavers

4095 search results - page 458 / 819
» How to test a tree
Sort
View
ICASSP
2011
IEEE
14 years 9 months ago
Informative dialect recognition using context-dependent pronunciation modeling
We propose an informative dialect recognition system that learns phonetic transformation rules, and uses them to identify dialects. A hidden Markov model is used to align referenc...
Nancy F. Chen, Wade Shen, Joseph P. Campbell, Pedr...
CPAIOR
2011
Springer
14 years 9 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
ICCV
2011
IEEE
14 years 6 months ago
Means in spaces of tree-like shapes
The mean is often the most important statistic of a dataset as it provides a single point that summarizes the entire set. While the mean is readily defined and computed in Euclid...
Aasa Feragen, Søren Hauberg, Mads Nielsen, Franç...
CCP
2011
92views more  CCP 2011»
14 years 6 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
EUROPAR
2011
Springer
14 years 5 months ago
A Generic Parallel Collection Framework
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data ...
Aleksandar Prokopec, Phil Bagwell, Tiark Rompf, Ma...