611 search results - page 36 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
PLDI
1995
ACM
13 years 11 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...