Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...