ECCC 2006 | Sciweavers

12

ECCC
2006

107views more ECCC 2006»

Energy Complexity and Entropy of Threshold Circuits

13 years 4 months ago

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

claim paper

Read More »

6

click to vote

ECCC
2006

77views more ECCC 2006»

Computational aspects of feedback in neural circuits

13 years 4 months ago

Download fias.uni-frankfurt.de

Wolfgang Maass, Prashant Joshi, Eduardo D. Sontag

claim paper

Read More »

6

click to vote

ECCC
2006

88views more ECCC 2006»

On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge

13 years 4 months ago

Download www.wisdom.weizmann.ac.il

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

claim paper

Read More »

9

click to vote

ECCC
2006

120views more ECCC 2006»

New Locally Decodable Codes and Private Information Retrieval Schemes

13 years 4 months ago

Download www.cs.umd.edu

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

claim paper

Read More »

7

click to vote

ECCC
2006

104views more ECCC 2006»

Graph partitioning via adaptive spectral techniques

13 years 4 months ago

Download web.mac.com

Amin Coja-Oghlan

claim paper

Read More »

8

click to vote

ECCC
2006

84views more ECCC 2006»

Improved Algorithms for Optimal Embeddings

13 years 4 months ago

Download www.cs.ucla.edu

Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky...

claim paper

Read More »

7

click to vote

ECCC
2006

88views more ECCC 2006»

Hardness of Directed Routing with Congestion

13 years 4 months ago

Download ttic.uchicago.edu

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

claim paper

Read More »

8

click to vote

ECCC
2006

123views more ECCC 2006»

A Note on Adaptivity in Testing Properties of Bounded Degree Graphs

13 years 4 months ago

Download www.cse.psu.edu

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

claim paper

Read More »

5

click to vote

ECCC
2006

71views more ECCC 2006»

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

13 years 4 months ago

Download www.cs.uoi.gr

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,...

claim paper

Read More »

7

click to vote

ECCC
2006

68views more ECCC 2006»

Lempel-Ziv Dimension for Lempel-Ziv Compression

13 years 4 months ago

Download webdiis.unizar.es

María López-Valdés

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers