993 search results - page 188 / 199 » The Complexity of Probabilistic EL |
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
IBPRIA
2003
Springer
14 years 26 days ago
2003
Springer
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
ICRA
2002
IEEE
14 years 18 days ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
ICALP
2001
Springer
14 years 4 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...