Sciweavers

371 search results - page 26 / 75
» Computation of the Minimal Associated Primes
Sort
View
ICA3PP
2005
Springer
14 years 1 months ago
A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...
Srikumar Venugopal, Rajkumar Buyya
ISBI
2008
IEEE
14 years 8 months ago
Variational B-spline level-set method for fast image segmentation
In the field of image segmentation, most of level-set-based active contour approaches are based on a discrete representation of the associated implicit function. We present in thi...
Olivier Bernard, Denis Friboulet, Philippe Th&eacu...
MICCAI
2009
Springer
14 years 1 days ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eï¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
RTCSA
2008
IEEE
14 years 1 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...