Sciweavers

15485 search results - page 195 / 3097
» Computing Optimal Subsets
Sort
View
CCGRID
2003
IEEE
15 years 11 months ago
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
Kento Aida, Wataru Natsume, Yoshiaki Futakata
ICPP
1995
IEEE
15 years 10 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 6 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li
ICIP
1995
IEEE
16 years 7 months ago
Parallel computation of sequential pixel updates in statistical tomographic reconstruction
While Bayesian methods can significantly improve the quality of tomographic reconstructions, they require the solution of large iterative optimization problems. Recent results ind...
Ken D. Sauer, S. Borman, Charles A. Bouman
CSDA
2007
109views more  CSDA 2007»
15 years 6 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker