— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...