Sciweavers

Share
ECCC
2006
107views more  ECCC 2006»
9 years 10 months ago
Energy Complexity and Entropy of Threshold Circuits
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas
ECCC
2006
77views more  ECCC 2006»
9 years 10 months ago
Computational aspects of feedback in neural circuits
Wolfgang Maass, Prashant Joshi, Eduardo D. Sontag
ECCC
2006
88views more  ECCC 2006»
9 years 10 months ago
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
Mihir Bellare, Oded Goldreich
ECCC
2006
120views more  ECCC 2006»
9 years 10 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ECCC
2006
84views more  ECCC 2006»
9 years 10 months ago
Improved Algorithms for Optimal Embeddings
Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky...
ECCC
2006
88views more  ECCC 2006»
9 years 10 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
ECCC
2006
123views more  ECCC 2006»
9 years 10 months ago
A Note on Adaptivity in Testing Properties of Bounded Degree Graphs
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
Sofya Raskhodnikova, Adam Smith
ECCC
2006
71views more  ECCC 2006»
9 years 10 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
ECCC
2006
68views more  ECCC 2006»
9 years 10 months ago
Lempel-Ziv Dimension for Lempel-Ziv Compression
María López-Valdés
books