Sciweavers

1036 search results - page 22 / 208
» Algorithms for Learning Regular Expressions
Sort
View
ESANN
2008
15 years 1 months ago
A Regularized Learning Method for Neural Networks Based on Sensitivity Analysis
The Sensitivity-Based Linear Learning Method (SBLLM) is a learning method for two-layer feedforward neural networks, based on sensitivity analysis, that calculates the weights by s...
Bertha Guijarro-Berdiñas, Oscar Fontenla-Ro...
115
Voted
NIPS
2008
15 years 1 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
JMLR
2006
186views more  JMLR 2006»
15 years 5 days ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
115
Voted
CSR
2006
Springer
15 years 3 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
104
Voted
CCR
2010
151views more  CCR 2010»
14 years 9 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...