1068 search results - page 48 / 214 » On Space Bounded Server Algorithms |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
IJRR
2002
13 years 7 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
EWRL
2008
13 years 9 months ago
2008
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...