Sciweavers

2254 search results - page 275 / 451
» Computing the minimal covering set
Sort
View
IFIPTCS
2010
15 years 4 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...

Publication
1686views
17 years 15 days ago
Information Preserving Color Transformation for Protanopia and Deuteranopia
In this letter, we proposed a new recoloring method for people with protanopic and deuteranopic color deficiencies.We present a color transformation that aims to preserve the color...
Jia-Bin Huang, Yu-Cheng Tseng, Se-In Wu, and Sheng...
ICIP
2003
IEEE
16 years 8 months ago
A probabilistic framework for image segmentation
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
Slawo Wesolkowski, Paul W. Fieguth
DAC
2005
ACM
16 years 7 months ago
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
MICCAI
2007
Springer
16 years 7 months ago
Live-Vessel: Extending Livewire for Simultaneous Extraction of Optimal Medial and Boundary Paths in Vascular Images
This paper incorporates multiscale vesselness filtering into the Livewire framework to simultaneously compute optimal medial axes and boundaries in vascular images. To this end, we...
Kelvin Poon, Ghassan Hamarneh, Rafeef Abugharbieh