189 search results - page 10 / 38 » Answering general time sensitive queries |
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
DIAL
2004
IEEE
13 years 11 months ago
2004
IEEE
Large collections of scanned documents (books and journals) are now available in Digital Libraries. The most common method for retrieving relevant information from these collectio...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...