Sciweavers

95 search results - page 10 / 19
» Truth in generic cuts
Sort
View
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 4 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
IJCV
2008
201views more  IJCV 2008»
13 years 7 months ago
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
ICMCS
2005
IEEE
93views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Comparison of shot boundary detectors
A video Cut Detector (CD), a member of the Shot Boundary Detector (SBD) group, is an essential element for spatio-temporal audiovisual (AV) segmentation and various video-processi...
Jan Nesvadba, Fabian Ernst, Jernej Perhavc, Jenny ...
GRAPHICSINTERFACE
2009
13 years 5 months ago
Rendering the effect of labradoescence
Labradorescence is a complex optical phenomenon that can be found in certain minerals, such as Labradorite or Spectrolite. Because of their unique colour properties, these mineral...
Andrea Weidlich, Alexander Wilkie
IOR
2011
152views more  IOR 2011»
13 years 2 months ago
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
Naomi Miller, Andrzej Ruszczynski