Sciweavers

279 search results - page 28 / 56
» Matching Polynomials And Duality
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
A Novel Model for Orientation Field of Fingerprints
As a global feature of fingerprint, orientation field is very important to automatic fingerprint identification system (AFIS). Establishing an accurate and concise model for orien...
Jinwei Gu, Jie Zhou
SAT
2007
Springer
146views Hardware» more  SAT 2007»
14 years 1 months ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer
FCT
2003
Springer
14 years 26 days ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
ICARIS
2009
Springer
13 years 11 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
CGF
2008
92views more  CGF 2008»
13 years 7 months ago
Pointwise radial minimization: Hermite interpolation on arbitrary domains
In this paper we propose a new kind of Hermite interpolation on arbitrary domains, matching derivative data of arbitrary order on the boundary. The basic idea stems from an interp...
Michael S. Floater, C. Schulz