316 search results - page 34 / 64 » Bounded Depth Data Trees |
104
click to vote
WEBDB
2005
Springer
15 years 8 months ago
2005
Springer
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
155
click to vote
COLT
2010
Springer
15 years 19 days ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
135
Voted
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
129
Voted
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
132
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...