Sciweavers

1284 search results - page 28 / 257
» Data Structures for Mergeable Trees
Sort
View
IPL
2002
59views more  IPL 2002»
13 years 6 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
CATA
2004
13 years 8 months ago
Decision Tree Induction for Dynamic, High-Dimensional Data Using P-Trees
1 Decision Tree Induction is a powerful classification tool that is much used in practice and works well for static data with dozens of attributes. We adapt the decision tree conce...
Anne Denton, William Perrizo
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
13 years 11 months ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
14 years 3 days ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....