Sciweavers

85 search results - page 8 / 17
» Optimal Blurred Segments Decomposition in Linear Time
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 6 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
VISUALIZATION
1998
IEEE
13 years 11 months ago
Hierarchical volume analysis and visualization based on morphological operators
One common problem in the practical application of volume visualization is the proper choice of transfer functions in order to color different parts of the volume meaningfully. Th...
Christoph Lürig, Thomas Ertl
CODES
2009
IEEE
14 years 1 months ago
FlexRay schedule optimization of the static segment
The FlexRay bus is the prospective automotive standard communication system. For the sake of a high flexibility, the protocol includes a static time-triggered and a dynamic event...
Martin Lukasiewycz, Michael Glaß, Jürge...
CONSTRAINTS
2011
12 years 10 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
PAMI
2012
11 years 9 months ago
Detachable Object Detection: Segmentation and Depth Ordering from Short-Baseline Video
—We describe an approach for segmenting a moving image into regions that correspond to surfaces in the scene that are partially surrounded by the medium. It integrates both appea...
Alper Ayvaci, Stefano Soatto