827 search results - page 24 / 166 » The Complexity of Probabilistic Lobbying |
111
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
106
click to vote
QCQC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
118
click to vote
ICANN
2010
Springer
15 years 2 months ago
2010
Springer
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
98
Voted
FSTTCS
1994
Springer
15 years 5 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
99
Voted
ISMIR
2004
Springer
15 years 7 months ago
2004
Springer
We propose a system which extracts the melody line played by a solo instrument from complex audio. At every time frame multiple fundamental frequency (F0) hypotheses are generated...