Sciweavers

1284 search results - page 62 / 257
» Data Structures for Mergeable Trees
Sort
View
UAI
1996
13 years 8 months ago
Binary Join Trees
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architectu...
Prakash P. Shenoy
IPL
2006
103views more  IPL 2006»
13 years 7 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
CGF
2004
111views more  CGF 2004»
13 years 7 months ago
Modeling Trees with Hypertextures
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...
Damjan Strnad, Nikola Guid
IS
2006
13 years 7 months ago
A methodology for clustering XML documents by structure
The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations ...
Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, T...
DRM
2007
Springer
14 years 1 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....