Sciweavers

2899 search results - page 410 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 5 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
JPDC
2010
137views more  JPDC 2010»
15 years 4 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
15 years 3 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 3 months ago
Genetic programming for quantitative stock selection
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
Ying L. Becker, Una-May O'Reilly
CORR
2011
Springer
160views Education» more  CORR 2011»
15 years 15 days ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...