2412 search results - page 107 / 483 » Which Problems Have Strongly Exponential Complexity |
118
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
90
Voted
KDD
2010
ACM
15 years 5 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
118
click to vote
AAAI
1990
15 years 4 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
142
Voted
ESORICS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
114
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...