137 search results - page 18 / 28 » Efficient Tree Search in Encrypted Data |
102
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
174
click to vote
WWCA
1998
Springer
15 years 3 months ago
1998
Springer
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
193
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
111
click to vote
VMV
2001
15 years 1 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...