220 search results - page 19 / 44 » The Forgiving Tree: A Self-Healing Distributed Data Structur... |
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--The provision of Quality of Service in Grid environments is still an open issue that needs attention from the research community. One way of contributing to the provision...