A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
We present an e cient technique for dynamically tessellating generalized cylinders. We make direct use of the generalized cylinder's screen-space projection in order to minim...
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
Most of audio source separation methods are developed for a particular scenario characterized by the number of sources and channels and the characteristics of the sources and the m...
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...