Accelerating an algorithm for perishable inventory control on heterogeneous platforms |
|
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement |
|
On refinement of the unit simplex using regular simplices |
|
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex |
|
Exploring the performance–power–energy balance of low-power multicore and manycore architectures for anomaly detection in remote sensing |
|
Heuristics for longest edge selection in Simplicial Branch and bound |
|
High performance computing for a 3-D optical diffraction tomographic application in fluid velocimetry |
|
On computing order quantities for perishable inventory control with non-stationary demand |
|
Parallel resolution of the 3D Helmholtz equation based on multi-graphics processing unit clusters |
|
FastSpMM: An efficient library for sparse matrix matrix product on GPUs |
|
Robust membrane detection based on tensor voting for electron tomography |
|
Pareto optimality and robustness in bi-blending problems |
|
Efficient implementation of hyperspectral anomaly detection techniques on GPUs and multicore processors |
|
Analysis and optimizations of global and local versions of the RX algorithm for anomaly detection in hyperspectral data |
|
On estimating workload in interval branch-and-bound global optimization algorithms |
|
A threaded approach of the quadratic bi-blending algorithm |
|
On interval branch-and-bound for additively separable functions with common variables |
|
A ridge-based framework for segmentation of 3D electron microscopy datasets |
|
Anomaly detection based on a parallel kernel RX algorithm for multicore platforms |
|
On endmember identification in hyperspectral images without pure pixels: A comparison of algorithms |
|
A new minimum-volume enclosing algorithm for endmember identification and abundance estimation in hyperspectral data |
|
Fixed or variable demand? Does it matter when locating a facility? |
|
A differential structure approach to membrane segmentation in electron tomography |
|
Parallel algorithms for continuous multifacility competitive location problems |
|
On determining the cover of a simplex by spheres centered at its vertices |
|
Finding multiple global optima for unconstrained discrete location problems |
|
Parallel evolutionary algorithms based on shared memory programming approaches |
|
Automatic tuning of iterative computation on heterogeneous multiprocessors with ADITHE |
|
Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures |
|
Impact of JPEG2000 compression on endmember extraction and unmixing of remotely sensed hyperspectral data |
|
XMSF: Structure-preserving noise reduction and pre-segmentation in microscope tomography |
|
Analytical performance prediction for iterative reconstruction techniques in electron tomography of biological structures |
|
Heuristics for the facility location and design (1|1)-centroid problem on the plane |
|
A robust and efficient algorithm for planar competitive location problems |
|
Solving the multiple competitive facilities location and design problem on the plane |
|
Exploiting desktop supercomputing for three-dimensional electron microscopy reconstructions using ART with blobs |
|
Sensitivity analysis of a continuous multifacility competitive location and design problem |
|
Interactive transmission of JPEG2000 images using Web proxy caching |
|
The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach |
|
Preface: Special issue Go05 |
|
Parameter optimization in 3D reconstruction on a large scale grid |
|
A population global optimization algorithm to solve the image alignment problem in electron crystallography |
|
Electron tomography of complex biological specimens on the Grid |
|
EGEETomo: A user-friendly, fault-tolerant and grid-enabled application for 3D reconstruction in electron tomography |
|
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints |
|
High performance noise reduction for biomedical multidimensional data |
|
Parallelization of reconstruction algorithms in three-dimensional electron microscopy |
|
On the suitability of biological structure determination by electron microscopy to grid computing |
|
Improvement in methodology for testing iterative reconstruction algorithms in 3D X-ray tomography |
|
Approaches based on permutations for partitioning sparse matrices on multiprocessors |
|
The potential of grid computing in three-dimensional electron microscopy |
|
Three-dimensional reconstruction of cellular structures by electron microscope tomography and parallel computing |
|
Grid Computing in structure determination of biological specimens by electron microscope tomography |
|
Image registration in electron microscopy. A stochastic optimization approach |
|
Phan3D: Design of biological phantoms in 3D electron microscopy |
|
Solving eigenproblems on multicomputers: Two different approaches |
|
Biological structure determination by EM is well suited to grid computing |
|
Heuristic rejection in interval global optimization |
|
Interval algorithms for finding the minimal root in a set of multiextremal one-dimensional nondifferentiable functions |
|
New interval analysis support functions using gradient information in a global minimization algorithm |
|
The load unbalancing problem for region growing image segmentation algorithms |
|
A VHDL library to analyse fault tolerant techniques |
|
An approach to teaching computer arithmetic |
|
High performance computing in electron microscope tomography of complex biological structures |
|
Educational Issues on Number Representation and Arithmetic in Computers: An Undergraduate Laboratory |
|
On using global optimization to obtain better performance of a MART algorithm in 3D X-ray tomography |
|
Progressive image transmission in telemicroscopy: A quantitative approach for electron microscopy images of biological specimens |
|
UEGO, an abstract clustering technique for multimodal global optimization |
|
Reliability and Performance of UEGO, a Clustering-based global Optimizer |
|
On success rates for controlled random search |
|
Parallel implementation for large and sparse eigenproblems |
|
Experiments with a new selection criterion in a fast interval optimization algorithm |
|
A heuristic rejection criterion in interval global optimization algorithms |
|
Parallelization of an algorithm for the automatic detection of deformable objects |
|
Parallel thinning algorithms on multicomputers: Experimental study on load balancing |
|
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions |
|
A New Multisection Technique in Interval Methods for Global Optimization |
|
A parallelized sequential random search global optimization algorithm |
|
Implementation and experimental evaluation of the constrained ART algorithm on a multicomputer system |
|
Parallel quadrant interlocking factorization on hypercube computers |
|