24529 search results - page 4748 / 4906 » Computing on Authenticated Data |
122
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
221
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
213
click to vote
VLDB
2004
ACM
16 years 3 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
171
Voted
VLDB
2008
ACM
16 years 3 months ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
216
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Cell phones are increasingly being used as common clients for a wide suite of distributed, database-centric healthcare applications in developing regions. This is particularly tru...