Sciweavers

1368 search results - page 151 / 274
» Generalized Rook Polynomials
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 6 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
142
Voted
ICMCS
2010
IEEE
171views Multimedia» more  ICMCS 2010»
15 years 6 months ago
Transforming a pattern identifier into biometric key generators
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...
Yongdong Wu, Bo Qiu
AMC
2008
78views more  AMC 2008»
15 years 5 months ago
Information processing in complex networks: Graph entropy and information functionals
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...
Matthias Dehmer
144
Voted
APAL
2008
84views more  APAL 2008»
15 years 5 months ago
Resolution over linear equations and multilinear proofs
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 ...
Ran Raz, Iddo Tzameret
CORR
2010
Springer
64views Education» more  CORR 2010»
15 years 5 months ago
Near-Optimal Evasion of Convex-Inducing Classifiers
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...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...