316 search results - page 14 / 64 » Bounded Depth Data Trees |
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. A...
SIGGRAPH
2000
ACM
14 years 1 months ago
2000
ACM
We present a method for automatically rendering pen-and-ink illustrations of trees. A given 3-d tree model is illustrated by the tree and a visual representation of the foliage us...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...