Sciweavers

287 search results - page 6 / 58
» Exact Cover with light
Sort
View
DAC
2005
ACM
14 years 8 months ago
Effective bounding techniques for solving unate and binate covering problems
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
IH
2007
Springer
14 years 1 months ago
Exposing Digital Forgeries Through Specular Highlights on the Eye
Abstract. When creating a digital composite of two people, it is difficult to exactly match the lighting conditions under which each individual was originally photographed. In many...
Micah K. Johnson, Hany Farid
ARSCOM
2000
79views more  ARSCOM 2000»
13 years 7 months ago
On exact bicoverings of 12 points
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
J. L. Allston, Mike J. Grannell, Terry S. Griggs, ...
AMFG
2003
IEEE
151views Biometrics» more  AMFG 2003»
14 years 20 days ago
Illumination Modeling and Normalization for Face Recognition
In this paper, we present a general framework for face modeling under varying lighting conditions. First, we show that a face lighting subspace can be constructed based on three o...
Haitao Wang, Stan Z. Li, Yangsheng Wang, Weiwei Zh...
CORR
2006
Springer
164views Education» more  CORR 2006»
13 years 7 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey