3946 search results - page 39 / 790 » The computational complexity of choice sets |
101
click to vote
CSFW
2011
IEEE
13 years 11 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
RSCTC
2000
Springer
15 years 3 months ago
2000
Springer
The aim of the paper is to present basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similari...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Feature extraction and classification are two important components in pattern recognition. In this paper, we propose dynamic target classification in WSNs. The main idea of this a...
ECCC
2007
14 years 11 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
124
click to vote
AAAI
2012
13 years 2 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...