Sciweavers

1343 search results - page 232 / 269
» Learning Weighted Automata
Sort
View
COMBINATORICA
2010
13 years 4 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
INTERSPEECH
2010
13 years 4 months ago
Binary coding of speech spectrograms using a deep auto-encoder
This paper reports our recent exploration of the layer-by-layer learning strategy for training a multi-layer generative model of patches of speech spectrograms. The top layer of t...
Li Deng, Michael L. Seltzer, Dong Yu, Alex Acero, ...
ML
2010
ACM
138views Machine Learning» more  ML 2010»
13 years 4 months ago
Mining adversarial patterns via regularized loss minimization
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Wei Liu, Sanjay Chawla
ICML
2002
IEEE
14 years 10 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
ICML
1998
IEEE
14 years 10 months ago
Feature Selection via Concave Minimization and Support Vector Machines
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
Paul S. Bradley, Olvi L. Mangasarian