Sciweavers

2095 search results - page 359 / 419
» Improved pebbling bounds
Sort
View
JPDC
2006
106views more  JPDC 2006»
13 years 10 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn
ML
2008
ACM
162views Machine Learning» more  ML 2008»
13 years 10 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch
PR
2008
85views more  PR 2008»
13 years 10 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 10 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
SIAMSC
2008
104views more  SIAMSC 2008»
13 years 10 months ago
Deblurring Methods Using Antireflective Boundary Conditions
In this note we consider the numerical solution of selfadjoint deblurring problems on bounded intervals. For these problems it has recently been shown that appropriate modelling of...
Martin Christiansen, Martin Hanke