Sciweavers

32 search results - page 6 / 7
» A sharp threshold in proof complexity
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 2 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 10 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
APAL
2010
85views more  APAL 2010»
13 years 11 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
ML
1998
ACM
13 years 10 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 10 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...