Sciweavers

1381 search results - page 118 / 277
» Structural signatures for tree data structures
Sort
View
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
14 years 11 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
15 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
ICDM
2006
IEEE
151views Data Mining» more  ICDM 2006»
15 years 4 months ago
Decision Trees for Functional Variables
Classification problems with functionally structured input variables arise naturally in many applications. In a clinical domain, for example, input variables could include a time...
Suhrid Balakrishnan, David Madigan
IFIP
2004
Springer
15 years 3 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 3 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz