Sciweavers

507 search results - page 80 / 102
» Sizes of Ordered Decision Trees
Sort
View
SPEECH
2010
94views more  SPEECH 2010»
13 years 2 months ago
Predicting the phonetic realizations of word-final consonants in context - A challenge for French grapheme-to-phoneme converters
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 8 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
SIGIR
2004
ACM
14 years 1 months ago
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
Shuang Liu, Fang Liu, Clement T. Yu, Weiyi Meng
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...