This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
In this paper we address the problem of reliable real-time 3D-tracking of multiple objects which are observed in multiple wide-baseline camera views. Establishing the spatio-tempo...
The difficulty to write successful 19x19 go programs lies not only in the combinatorial complexity of go but also in the complexity of designing a good evaluation function containi...
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Multi-state molecules and multi-component complexes are commonly involved in cellular signaling. Accounting for molecules that have multiple potential states, such as a protein tha...
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...