Sciweavers

3837 search results - page 86 / 768
» Learning Approximate Consistencies
Sort
View
JSA
2008
124views more  JSA 2008»
15 years 4 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ICTAI
2006
IEEE
15 years 10 months ago
Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
Daniel Stronger, Peter Stone
154
Voted
ICML
2010
IEEE
15 years 5 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
ICA
2010
Springer
15 years 5 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
ALT
2009
Springer
16 years 1 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee