Sciweavers

2899 search results - page 41 / 580
» Dynamic Trees in Practice
Sort
View
APWEB
2006
Springer
14 years 17 days ago
Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree
Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a ch...
Yun Bai, Yanyan Guo, Xiaofeng Meng, Tao Wan, Karin...
COCOON
1998
Springer
14 years 1 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
AAAI
2004
13 years 10 months ago
Using Performance Profile Trees to Improve Deliberation Control
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...
Kate Larson, Tuomas Sandholm
DAC
1997
ACM
14 years 1 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
APPROX
2009
Springer
80views Algorithms» more  APPROX 2009»
14 years 3 months ago
The Glauber Dynamics for Colourings of Bounded Degree Trees
Brendan Lucier, Michael Molloy, Yuval Peres