Sciweavers

3251 search results - page 176 / 651
» On a vector q-d algorithm
Sort
View
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 7 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
ICIP
2001
IEEE
16 years 5 months ago
Fast computation of morphological area pattern spectra
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
Arnold Meijster, Michael H. F. Wilkinson
DCC
2001
IEEE
16 years 2 months ago
On Zador's Entropy-Constrained Quantization Theorem
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorith...
Robert M. Gray, Jia Li
71
Voted
ICDAR
2003
IEEE
15 years 8 months ago
Numeral Recognition by Weighting Local Decisions
This paper presents a new technique to improve the combination of classification decisions obtained from local analysis of patterns. Specifically, a genetic algorithm is used to d...
Giovanni Dimauro, Sebastiano Impedovo, Raffaele Mo...
IJCAI
2003
15 years 4 months ago
Approximate Policy Iteration using Large-Margin Classifiers
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
Michail G. Lagoudakis, Ronald Parr