Sciweavers

1284 search results - page 13 / 257
» Data Structures for Mergeable Trees
Sort
View
PAMI
2011
13 years 1 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 6 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
ICDE
2010
IEEE
494views Database» more  ICDE 2010»
14 years 6 months ago
Hashing Tree-Structured Data: Methods and Applications
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...
Shirish Tatikonda, Srinivasan Parthasarathy
SDMW
2004
Springer
14 years 2 days ago
Secure and Privacy Preserving Outsourcing of Tree Structured Data
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
Ping Lin, K. Selçuk Candan
SMI
2005
IEEE
111views Image Analysis» more  SMI 2005»
14 years 9 days ago
The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional scalar field based on unstructured tetrahedral meshes. Such data s...
Emanuele Danovaro, Leila De Floriani, Paola Magill...