Sciweavers

1963 search results - page 297 / 393
» The Maximum Solution Problem on Graphs
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Contour-based hidden Markov model to segment 2D ultrasound images
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
Xiaoning Qian, Byung-Jun Yoon
CVPR
2008
IEEE
15 years 2 days ago
3D occlusion recovery using few cameras
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
Mark A. Keck, James W. Davis
CP
2005
Springer
14 years 3 months ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
IPPS
1996
IEEE
14 years 2 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
14 years 2 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik