Sciweavers

1051 search results - page 198 / 211
» Single Run Optimization Using the Reverse-Simulation Method
Sort
View
KDD
1997
ACM
143views Data Mining» more  KDD 1997»
15 years 3 months ago
Anytime Exploratory Data Analysis for Massive Data Sets
Exploratory data analysis is inherently an iterative, interactive endeavor. In the context of massive data sets, however, many current data analysis algorithms will not scale appr...
Padhraic Smyth, David Wolpert
LREC
2008
174views Education» more  LREC 2008»
15 years 1 months ago
Automatic Phoneme Segmentation with Relaxed Textual Constraints
Speech synthesis by unit selection requires the segmentation of a large single speaker high quality recording. Automatic speech recognition techniques, e.g. Hidden Markov Models (...
Pierre Lanchantin, Andrew C. Morris, Xavier Rodet,...
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
14 years 12 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
CSL
2007
Springer
14 years 11 months ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 3 days ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han