#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1993

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joseph J. Atick, Paul A. Griffin, Amanda Redlich
- Neural computation
- 1996

The human visual system is proficient in perceiving three-dimensional shape from the shading patterns in a two-dimensional image. How it does this is not well understood and continues to be aâ€¦ (More)

- Joseph J. Atick, Z. Li, Amanda Redlich
- Vision research
- 1993

We examine the implications of the hypothesis that color information in the cortex is adaptively coded into a factorial (statistically independent) and gain-controlled representation. We show thatâ€¦ (More)

- Bobby DeMarco, Jeff Kahn, Amanda Redlich
- Electr. J. Comb.
- 2015

Answering a question of Kolaitis and Kopparty, we show that, for given integer q > 1 and pairwise nonisomorphic connected graphs G1, . . . , Gk, if p = p(n) is such that Pr(Gn,p âŠ‡ Gi) â†’ 1 âˆ€i, then,â€¦ (More)

- Sangameshwar Patil, Sasanka Roy, +6 authors Ankit Mehrotra
- COMAD
- 2010

As part of their information management lifecycle, organizations periodically face the important and inevitable task of migrating databases from one software and hardware platform to another. Apartâ€¦ (More)

- Amanda Redlich
- SIAM J. Discrete Math.
- 2017

- David D Eisenstat, Gary Gordon, Amanda Redlich
- SIAM J. Discrete Math.
- 2008

For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine combinatorialâ€¦ (More)

- Joseph J. Atick, Amanda Redlich
- Biological Cybernetics
- 2004

A mathematical model for the spatial computations performed by simple cells in the mammalian visual cortex is derived. The construction uses as organizing principles the experimentally observedâ€¦ (More)

- David D Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich
- Discrete Applied Mathematics
- 2008

For a rooted graph G, let EVb(G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We determine the expectedâ€¦ (More)

- John Augustine, William K. Moses, Amanda Redlich, Eli Upfal
- SODA
- 2016

Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm Greedy[d] of Azar et al. places each ball by probing d > 1 random bins and placing theâ€¦ (More)

- Bobby DeMarco, Amanda Redlich
- Journal of Graph Theory
- 2016

Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph G(n, p). We use anâ€¦ (More)