Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
: This article addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive imag...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
We study the learnability of Threshold functions with bounded weights using membership queries only. We show that the class Ct of Threshold functions with positive integer weights...
Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar ...
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...