Sciweavers

656 search results - page 5 / 132
» Minimal non-convex words
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Application specific loss minimization using gradient boosting
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
Bin Zhang, Abhinav Sethy, Tara N. Sainath, Bhuvana...
87
Voted
INTERSPEECH
2010
14 years 4 months ago
Prominence detection in Swedish using syllable correlates
This paper presents an approach to estimating word level prominence in Swedish using syllable level features. The paper discusses the mismatch problem of annotations between word ...
Samer Al Moubayed, Jonas Beskow
AMW
2010
14 years 11 months ago
What You Must Remember When Processing Data Words
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
Michael Benedikt, Clemens Ley, Gabriele Puppis
IJCNLP
2004
Springer
15 years 3 months ago
Word Folding: Taking the Snapshot of Words Instead of the Whole
The snapshot of a word means the most informative fragment of the word. By taking the snapshot instead of the whole, the value space of the lexical feature can be significantly r...
Jin-Dong Kim, Jun-ichi Tsujii
64
Voted
TCS
2002
14 years 9 months ago
Words and forbidden factors
Given a
Filippo Mignosi, Antonio Restivo, Marinella Sciort...