Moshe Dubiner

According to our database, Moshe Dubiner authored at least 10 papers between 1992 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2013

The Maximum Entropy Relaxation Path.

Moshe Dubiner, Matan Gavish, Yoram Singer

CoRR, 2013

2012

A Heterogeneous High-Dimensional Approximate Nearest Neighbor Algorithm.

Moshe Dubiner

IEEE Trans. Inf. Theory, 2012

2011

Entire Relaxation Path for Maximum Entropy Problems.

Moshe Dubiner, Yoram Singer

Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 2011

2010

Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem.

Moshe Dubiner

IEEE Trans. Inf. Theory, 2010

Large Scale Parallel Document Mining for Machine Translation.

Jakob Uszkoreit, Jay Ponte, Ashok C. Popat, Moshe Dubiner

Proceedings of the COLING 2010, 2010

1997

Amplification by Read-Once Formulas.

Moshe Dubiner, Uri Zwick

SIAM J. Comput., 1997

1995

A Lattice Point Problem and Additive Number Theory.

Noga Alon, Moshe Dubiner

Comb., 1995

1994

Faster Tree Pattern Matching.

Moshe Dubiner, Zvi Galil, Edith Magen

J. ACM, 1994

How Do Read-Once Formulae Shrink?

Moshe Dubiner, Uri Zwick

Comb. Probab. Comput., 1994

1992

Amplification and Percolation

Moshe Dubiner, Uri Zwick

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992