Sciweavers

1736 search results - page 32 / 348
» String Extension Learning
Sort
View
ICPR
2010
IEEE
15 years 16 days ago
Temporal Extension of Laplacian Eigenmaps for Unsupervised Dimensionality Reduction of Time Series
—A novel non-linear dimensionality reduction method, called Temporal Laplacian Eigenmaps, is introduced to process efficiently time series data. In this embedded-based approach,...
Michal Lewandowski, Jesus Martinez-Del-Rincon, Dim...
SYNTHESE
2008
84views more  SYNTHESE 2008»
14 years 10 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
77
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Confidence estimation, OOV detection and language ID using phone-to-word transduction and phone-level alignments
Automatic Speech Recognition (ASR) systems continue to make errors during search when handling various phenomena including noise, pronunciation variation, and out of vocabulary (O...
Christopher M. White, Geoffrey Zweig, Lukas Burget...
ANCS
2005
ACM
15 years 3 months ago
High-throughput linked-pattern matching for intrusion detection systems
This paper presents a hardware architecture for highly efficient intrusion detection systems. In addition, a software tool for automatically generating the hardware is presented....
Zachary K. Baker, Viktor K. Prasanna
COMBINATORICA
2010
14 years 7 months ago
A note on disjoint arborescences
Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds' theorem on disjoint spanning branchin...
Satoru Fujishige