Sciweavers

5302 search results - page 284 / 1061
» Learning How to Separate
Sort
View
ACL
1996
15 years 8 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley
ICDE
2010
IEEE
195views Database» more  ICDE 2010»
15 years 6 months ago
Automatic tuning of the multiprogramming level in Sybase SQL Anywhere
— This paper looks at the problem of automatically tuning the database server multiprogramming level to improve database server performance under varying workloads. We describe t...
Mohammed Abouzour, Kenneth Salem, Peter Bumbulis
187
Voted
ACL
2009
15 years 4 months ago
Parsing Speech Repair without Specialized Grammar Symbols
This paper describes a parsing model for speech with repairs that makes a clear separation between linguistically meaningful symbols in the grammar and operations specific to spee...
Tim Miller, Luan Nguyen, William Schuler
INFORMS
2010
100views more  INFORMS 2010»
15 years 3 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
PR
2006
111views more  PR 2006»
15 years 6 months ago
An adaptive error penalization method for training an efficient and generalized SVM
A novel training method has been proposed for increasing efficiency and generalization of support vector machine (SVM). The efficiency of SVM in classification is directly determi...
Yiqiang Zhan, Dinggang Shen