Sciweavers

2474 search results - page 207 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
178
Voted
LCPC
1997
Springer
15 years 10 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
ICASSP
2009
IEEE
16 years 1 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
ICPPW
2005
IEEE
15 years 12 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
ICS
1999
Tsinghua U.
15 years 10 months ago
Eliminating synchronization bottlenecks in object-based programs using adaptive replication
This paper presents a technique, adaptive replication, for automatically eliminating synchronization bottlenecks in multithreaded programs that perform atomic operations on object...
Martin C. Rinard, Pedro C. Diniz
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 6 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...