Sciweavers

738 search results - page 81 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 3 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
TIFS
2008
121views more  TIFS 2008»
14 years 9 months ago
Effect of Severe Image Compression on Iris Recognition Performance
We investigate three schemes for severe compression of iris images in order to assess what their impact would be on recognition performance of the algorithms deployed today for ide...
John Daugman, Cathryn Downing
86
Voted
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 1 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
CVPR
2007
IEEE
15 years 11 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...
ICPR
2006
IEEE
15 years 11 months ago
A Non-Iterative Approach to Reconstruct Face Templates from Match Scores
Regeneration of biometric templates from match scores has security and privacy implications related to any biometric based authentication system. In this paper, we propose a novel...
Pranab Mohanty, Rangachar Kasturi, Sudeep Sarkar