Sciweavers

414 search results - page 25 / 83
» Functional Programming in Sublinear Space
Sort
View
MP
2008
91views more  MP 2008»
13 years 10 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
Defeng Sun, Jie Sun, Liwei Zhang
EVOW
2007
Springer
14 years 1 months ago
Multiclass Object Recognition Based on Texture Linear Genetic Programming
This paper presents a linear genetic programming approach, that solves simultaneously the region selection and feature extraction tasks, that are applicable to common image recogni...
Gustavo Olague, Eva Romero, Leonardo Trujillo, Bir...
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 10 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
TIT
2010
128views Education» more  TIT 2010»
13 years 4 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
AAAI
1990
13 years 11 months ago
A Proven Domain-Independent Scientific Function-Finding Algorithm
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
Cullen Schaffer