Sciweavers

36 search results - page 7 / 8
» On the Chromatic Thresholds of Hypergraphs
Sort
View
ECCV
1992
Springer
15 years 20 days ago
Recovering Shading from Color Images
Existing shape-from-shading algorithms assume constant reflectance across the shaded surface. Multi-colored surfaces are excluded because both shading and reflectance affect the me...
Brian V. Funt, Mark S. Drew, Michael Brockington
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
14 years 4 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
JCT
2010
109views more  JCT 2010»
13 years 9 months ago
Avoider-Enforcer: The rules of the game
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
JCP
2008
161views more  JCP 2008»
13 years 10 months ago
Visual Cryptography for General Access Structure Using Pixel-block Aware Encoding
Multi-pixel encoding is an emerging method in visual cryptography for that it can encode more than one pixel for each encoding run. Nevertheless, in fact its encoding efficiency is...
Haibo Zhang, Xiaofei Wang, Wanhua Cao, Youpeng Hua...
PAMI
2006
278views more  PAMI 2006»
13 years 10 months ago
On the Removal of Shadows from Images
This paper is concerned with the derivation of a progression of shadow-free image representations. First, we show that adopting certain assumptions about lights and cameras leads t...
Graham D. Finlayson, Steven D. Hordley, Cheng Lu, ...