Sciweavers

115 search results - page 9 / 23
» Versioning Tree Structures by Path-Merging
Sort
View
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
ORL
2008
99views more  ORL 2008»
13 years 9 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ERCIMDL
2009
Springer
167views Education» more  ERCIMDL 2009»
14 years 4 months ago
A Compressed Self-indexed Representation of XML Documents
This paper presents a structure we call XML Wavelet Tree (XWT) to represent any XML document in a compressed and self-indexed form. Therefore, any query or procedure that could be ...
Nieves R. Brisaboa, Ana Cerdeira-Pena, Gonzalo Nav...
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 9 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
AAAI
2008
14 years 4 days ago
Adapting ADtrees for High Arity Features
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
Robert Van Dam, Irene Langkilde-Geary, Dan Ventura