Sciweavers

1284 search results - page 56 / 257
» Data Structures for Mergeable Trees
Sort
View
NAACL
2001
13 years 9 months ago
Applying Co-Training Methods to Statistical Parsing
We propose a novel Co-Training method for statistical parsing. The algorithm takes as input a small corpus (9695 sentences) annotated with parse trees, a dictionary of possible le...
Anoop Sarkar
INTERSPEECH
2010
13 years 2 months ago
Context adaptive training with factorized decision trees for HMM-based speech synthesis
To achieve natural high quality synthesised speech in HMMbased speech synthesis, the effective modelling of complex acoustic and linguistic contexts is critical. Traditional appro...
Kai Yu, Heiga Zen, François Mairesse, Steve...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
IJCAI
2003
13 years 9 months ago
Information Extraction from Tree Documents by Learning Subtree Delimiters
Information extraction from HTML pages has been conventionally treated as plain text documents extended with HTML tags. However, the growing maturity and correct usage of HTML/XHT...
Boris Chidlovskii
ENTCS
2010
101views more  ENTCS 2010»
13 years 4 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach