We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Multiple scattering in participating media is generally a complex phenomenon. In the limit of an optically thick medium, i.e., when the mean free path of each photon is much smalle...