1133 search results - page 145 / 227 » Basics of Graph Cuts |
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
ITICSE
2009
ACM
15 years 4 months ago
2009
ACM
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...
CSCWD
2008
Springer
14 years 11 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
156
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...