455 search results - page 2 / 91 » Using Top Trees For Easy Programming of Tree Algorithms |
ENTCS
2008
13 years 4 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
WSC
2004
13 years 5 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
APLAS
2003
ACM
13 years 9 months ago
2003
ACM
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
ECCV
2006
Springer
14 years 6 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...