Sciweavers

2376 search results - page 277 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
TASLP
2010
157views more  TASLP 2010»
13 years 4 months ago
HMM-Based Reconstruction of Unreliable Spectrographic Data for Noise Robust Speech Recognition
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
Bengt J. Borgstrom, Abeer Alwan
HPDC
2009
IEEE
14 years 1 months ago
Maestro: a self-organizing peer-to-peer dataflow framework using reinforcement learning
In this paper we describe Maestro, a dataflow computation framework for Ibis, our Java-based grid middleware. The novelty of Maestro is that it is a self-organizing peer-to-peer s...
C. van Reeuwijk
CIKM
1993
Springer
14 years 1 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
DMIN
2006
122views Data Mining» more  DMIN 2006»
13 years 11 months ago
Clustering of Bi-Dimensional and Heterogeneous Time Series: Application to Social Sciences Data
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
Rémi Gaudin, Sylvaine Barbier, Nicolas Nico...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 9 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye