Sciweavers

1381 search results - page 86 / 277
» Structural signatures for tree data structures
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
14 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
CGI
2000
IEEE
15 years 2 months ago
Reconstruction of B-spline Surfaces from Scattered Data Points
We present a new approach for reconstructing a smooth surface from a set of scattered points in three-dimensional (3D) space. Our algorithm first decomposes a given point set int...
Benjamin F. Gregorski, Bernd Hamann, Kenneth I. Jo...
COMCOM
2010
276views more  COMCOM 2010»
14 years 10 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
IPL
2002
59views more  IPL 2002»
14 years 9 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
DATESO
2009
158views Database» more  DATESO 2009»
14 years 7 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...