Sciweavers

843 search results - page 38 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
EAAI
2007
103views more  EAAI 2007»
13 years 7 months ago
Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
Ganesh K. Venayagamoorthy, Scott C. Smith, Gaurav ...
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
13 years 11 months ago
Classifier prediction based on tile coding
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
PPAM
2005
Springer
14 years 26 days ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 7 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský