2194 search results - page 277 / 439 » Improving HLRTA*( k ) |
VISUALIZATION
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional ...
110
click to vote
FAW
2009
Springer
15 years 6 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
104
click to vote
LATA
2009
Springer
15 years 5 months ago
2009
Springer
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
112
click to vote
STACS
2009
Springer
15 years 5 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...