198 search results - page 30 / 40 » Weak Probabilistic Anonymity |
DICTA
2007
13 years 10 months ago
2007
This paper presents an appearance–based method to automatically determine places from vision data for topological mapping. The approach exploits the continuity of the visual app...
DCG
2000
13 years 9 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
CPC
2002
13 years 9 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
AI
1999
Springer
13 years 8 months ago
1999
Springer
This paper addresses the relations between information retrieval (IR) and AI. It examines document retrieval, summarising its essential features and illustrating the state of its ...
JACM
2002
13 years 8 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...