Robert Van Dam

Learn More
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 incrementally updated dataset. For low arity symbolic features, ADtrees trade a slight increase in query time for a reduction in overall tree size. Unfortunately, for high arity features,(More)
The ADtree, a data structure useful for caching sufficient statistics, has been successfully adapted to grow lazily when memory is limited and to update sequentially with an incrementally updated dataset. However, even these modified forms of the ADtree still exhibit inefficiencies in terms of both space usage and query time, particularly on datasets with(More)
  • Robert Van Dam, Dan Date, Irene Ventura, Langkilde-Geary, Scott Date, Woodfield +3 others
  • 2008
This thesis has been read by each member of the following graduate committee and by majority vote has been found to be satisfactory. As chair of the candidate's graduate committee, I have read the thesis of Robert Van Dam in its final form and have found that (1) its format, citations, and bibliographical style are consistent and acceptable and fulfill(More)
  • 1