4095 search results - page 179 / 819 » How to test a tree |
CGF
2006
13 years 10 months ago
2006
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
COMCOM
2006
13 years 10 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
JEA
2008
13 years 10 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
AAAI
2012
12 years 1 months ago
2012
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...