We investigate in this paper the anchor selection problem with consideration of anchor location uncertainty, which arises naturally from error propagation problem in successive or...
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...