Sciweavers

2513 search results - page 151 / 503
» Improving Generalization by Data Categorization
Sort
View
TASLP
2008
120views more  TASLP 2008»
15 years 6 months ago
Rapid Speaker Adaptation Using Clustered Maximum-Likelihood Linear Basis With Sparse Training Data
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
Yun Tang, Richard Rose
ICASSP
2011
IEEE
14 years 10 months ago
SVM feature selection for multidimensional EEG data
In many machine learning applications, like Brain - Computer Interfaces (BCI), only high-dimensional noisy data are available rendering the discrimination task non-trivial. In thi...
Nisrine Jrad, Ronald Phlypo, Marco Congedo
DAC
2002
ACM
16 years 7 months ago
Hole analysis for functional coverage data
One of the main goals of coverage tools is to provide the user with informative presentation of coverage information. Specifically, information on large, cohesive sets of uncovere...
Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv
RECOMB
2005
Springer
16 years 6 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
DASFAA
2010
IEEE
179views Database» more  DASFAA 2010»
16 years 1 months ago
Scalable Splitting of Massive Data Streams
Scalable execution of continuous queries over massive data streams often requires splitting input streams into parallel sub-streams over which query operators are executed in paral...
Erik Zeitler, Tore Risch