Sciweavers

137 search results - page 6 / 28
» Efficient Tree Search in Encrypted Data
Sort
View
PVLDB
2010
190views more  PVLDB 2010»
13 years 4 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
Xavier Boyen, Brent Waters
BMCBI
2010
135views more  BMCBI 2010»
13 years 10 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
WIDM
2004
ACM
14 years 3 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen