Sciweavers

921 search results - page 134 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
IV
2005
IEEE
161views Visualization» more  IV 2005»
15 years 9 months ago
Adaptive Site Map Visualization Based on Landmarks
Site maps are frequently provided on Web sites as a navigation support for Web users. The automatic generation of site maps is a complex task since the structure of the data, sema...
Dirk Kukulenz
VISUALIZATION
1998
IEEE
15 years 8 months ago
Isosurface extraction in time-varying fields using a temporal hierarchical index tree
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
Han-Wei Shen
CIKM
2011
Springer
14 years 4 months ago
SIMD-based decoding of posting lists
Powerful SIMD instructions in modern processors offer an opportunity for greater search performance. In this paper, we apply these instructions to decoding search engine posting ...
Alexander A. Stepanov, Anil R. Gangolli, Daniel E....
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 4 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
IJRR
2007
171views more  IJRR 2007»
15 years 4 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars