#### Filter Results:

- Full text PDF available (74)

#### Publication Year

1992

2018

- This year (6)
- Last 5 years (36)
- Last 10 years (63)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Oded Goldreich, Shafi Goldwasser, Dana Ron
- Electronic Colloquium on Computational Complexity
- 1996

In this paper, we consider the question of determining whether a function <italic>f</italic> has property P or is Îµ-far from any function with property P. A <italic>property testing</italic>â€¦ (More)

- Dana Ron, Yoram Singer, Naftali Tishby
- Machine Learning
- 1996

We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic finite automata which we nameâ€¦ (More)

- Michael Kearns, Dana Ron
- Neural Computation
- 1997

In this article we prove sanity-check bounds for the error of the leave-oneout cross-validation estimate of the generalization error: that is, bounds showing that the worst-case error of thisâ€¦ (More)

- Oded Goldreich, Dana Ron
- Electronic Colloquium on Computational Complexity
- 2000

We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold orâ€¦ (More)

- Dana Ron, Yoram Singer, Naftali Tishby
- NIPS
- 1993

We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scales. On short scalesâ€¦ (More)

- Dana Ron, Yoram Singer, Naftali Tishby
- COLT
- 1995

We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishability property of theâ€¦ (More)

- Michal Parnas, Dana Ron
- Theor. Comput. Sci.
- 2007

For a given graph G over n vertices, let OPT G denote the size of an optimal solution in G of a particular minimization problem (e.g., the size of a minimum vertex cover). A randomized algorithm willâ€¦ (More)

- Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
- FOCS
- 2002

Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call minimum conflict-free coloring (min-CF-coloring). In its general form, theâ€¦ (More)

- Michal Parnas, Dana Ron, Ronitt Rubinfeld
- Electronic Colloquium on Computational Complexity
- 2004

- Ilan Kremer, Noam Nisan, Dana Ron
- computational complexity
- 1995

We present several results regarding randomized one-round communication complexity. Our results include a connection to the VC-dimension, a study of the problem of computing the inner product of twoâ€¦ (More)