We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
David Eppstein, Michael T. Goodrich, Daniel S. Hir...
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...