Sciweavers

321 search results - page 3 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 1 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
INTERSPEECH
2010
13 years 1 months ago
Modeling liaison in French by using decision trees
French is known to be a language with major pronunciation irregularities at word endings with consonants. Particularly, the well-known phonetic phenomenon called Liaison is one of...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
MTA
2007
122views more  MTA 2007»
13 years 5 months ago
Geometrically invariant watermarking: synchronization through circular Hough transform
This paper addresses a geometrically invariant watermarking method for digital images. Most previous watermarking algorithms perform weakly against geometric distortions, which des...
Hae-Yeoun Lee, Choong-Hoon Lee, Heung-Kyu Lee
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 7 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
ANLP
1992
68views more  ANLP 1992»
13 years 7 months ago
Evaluating Parsing Strategies Using Standardized Parse Files
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
Ralph Grishman, Catherine Macleod, John Sterling