Algorithms | Sciweavers

35

click to vote

STOC
1993
ACM

123views Algorithms» more STOC 1993»

Deterministic coding for interactive communication

14 years 3 months ago

Download www.cds.caltech.edu

Leonard J. Schulman

claim paper

Read More »

32

click to vote

STOC
1993
ACM

179views Algorithms» more STOC 1993»

The network inhibition problem

14 years 3 months ago

Download www.optimization-online.org

We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...

Cynthia A. Phillips

claim paper

Read More »

31

click to vote

STOC
1993
ACM

85views Algorithms» more STOC 1993»

What can be computed locally?

14 years 3 months ago

Download dcg.ethz.ch

Moni Naor, Larry J. Stockmeyer

claim paper

Read More »

20

click to vote

STOC
1993
ACM

94views Algorithms» more STOC 1993»

Finiteness results for sigmoidal "neural" networks

14 years 3 months ago

Download www.mit.edu

Angus Macintyre, Eduardo D. Sontag

claim paper

Read More »

39

click to vote

STOC
1993
ACM

141views Algorithms» more STOC 1993»

Bounds for the computational power and learning complexity of analog neural nets

14 years 3 months ago

Download www.igi.tugraz.at

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

claim paper

Read More »

27

click to vote

STOC
1993
ACM

82views Algorithms» more STOC 1993»

Efficient construction of a small hitting set for combinatorial rectangles in high dimension

14 years 3 months ago

Download www.cs.huji.ac.il

Nathan Linial, Michael Luby, Michael E. Saks, Davi...

claim paper

Read More »

32

click to vote

STOC
1993
ACM

123views Algorithms» more STOC 1993»

Constructing small sample spaces satisfying given constraints

14 years 3 months ago

Download theory.stanford.edu

Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...

Daphne Koller, Nimrod Megiddo

claim paper

Read More »

30

click to vote

STOC
1993
ACM

117views Algorithms» more STOC 1993»

Efficient noise-tolerant learning from statistical queries

14 years 3 months ago

Download www.cs.iastate.edu

In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...

Michael J. Kearns

claim paper

Read More »

20

click to vote

STOC
1993
ACM

120views Algorithms» more STOC 1993»

Characterizing non-deterministic circuit size

14 years 3 months ago

Download www.math.ias.edu

Mauricio Karchmer, Avi Wigderson

claim paper