5 search results - page 1 / 1 » Synthesis of fast programs for maximum segment sum problems |
GPCE
2009
Springer
13 years 9 months ago
2009
Springer
JEI
2006
13 years 4 months ago
2006
In this paper, we show how Markovian strategies used to solve well-known segmentation problems such as motion estimation, motion detection, motion segmentation, stereovision, and c...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
A structured approach to parallel programming allows to construct applications by composing skeletons, i.e., recurring patterns of task- and data-parallelism. First academic and co...
ICIAP
2005
ACM
13 years 10 months ago
2005
ACM
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...