17 search results - page 3 / 4 » Universal Limit Laws for Depths in Random Trees |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
CVPR
2009
IEEE
15 years 17 days ago
2009
IEEE
Depth maps captured with time-of-flight cameras have
very low data quality: the image resolution is rather limited
and the level of random noise contained in the depth maps
is v...
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
JAL
2002
13 years 5 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
JAIR
2011
13 years 12 days ago
2011
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...