Sciweavers

2474 search results - page 192 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
MIDDLEWARE
2004
Springer
15 years 11 months ago
Application partitioning and hierarchical management in grid environments
Several works on grid computing have been proposed in the last years. However, most of them, including available software, can not deal properly with some issues related to contro...
Patrícia Kayser Vargas, Inês de Castr...
CVPR
2007
IEEE
16 years 21 days ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
SAC
2010
ACM
16 years 1 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...