685 search results - page 27 / 137 » Succinct Trees in Practice |
ETRICS
2006
13 years 11 months ago
2006
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
JALC
2007
13 years 7 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...