1380 search results - page 152 / 276 » A General Polynomial Sieve |
ICMCS
2010
IEEE
13 years 10 months ago
2010
IEEE
According to a popular pattern recognition method, this paper proposes two methods to generate a secret from individual's biometric information, such as fingerprint feature p...
AMC
2008
13 years 9 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
APAL
2008
13 years 9 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade de...
DAM
2010
13 years 9 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...