6142 search results - page 556 / 1229 » The Complexity of Partition Functions |
198
click to vote
SIGECOM
2010
ACM
15 years 12 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
188
click to vote
FSE
2010
Springer
15 years 12 months ago
2010
Springer
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
192
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
161
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
172
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...