1133 search results - page 100 / 227 » Basics of Graph Cuts |
128
Voted
STACS
1991
Springer
15 years 7 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
129
Voted
IJISTA
2008
15 years 3 months ago
2008
: We combine a low resolution time-of-flight depth image camera based on photonic mixer devices with two standard cameras in a stereo configuration. We show that this approach is u...
144
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a new algorithm for segmenting video frames into temporally stable colored regions, applying our technique to create artistic stylizations (e.g. cartoons and paintings)...
132
Voted
ENDM
2010
15 years 29 days ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
142
Voted
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...