Sciweavers

402 search results - page 75 / 81
» A branch and cut algorithm for the Steiner problem in graphs
Sort
View
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 11 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
PAMI
2007
169views more  PAMI 2007»
13 years 6 months ago
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
Li Zhang, Steven M. Seitz
CVPR
2003
IEEE
14 years 8 months ago
Stereo Matching with Reflections and Translucency
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
CGO
2003
IEEE
13 years 10 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
BMCBI
2010
218views more  BMCBI 2010»
13 years 6 months ago
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
Michael Scharfe, Rainer Pielot, Falk Schreiber