Sciweavers

3250 search results - page 308 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
16 years 24 days ago
Knowledge reuse in genetic programming applied to visual learning
We propose a method of knowledge reuse for an ensemble of genetic programming-based learners solving a visual learning task. First, we introduce a visual learning method that uses...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
NIPS
2008
15 years 8 months ago
Biasing Approximate Dynamic Programming with a Lower Discount Factor
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
Marek Petrik, Bruno Scherrer
CEC
2010
IEEE
15 years 4 months ago
Active Learning Genetic programming for record deduplication
The great majority of genetic programming (GP) algorithms that deal with the classification problem follow a supervised approach, i.e., they consider that all fitness cases availab...
Junio de Freitas, Gisele L. Pappa, Altigran Soares...
PE
2010
Springer
102views Optimization» more  PE 2010»
15 years 5 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley