2610 search results - page 433 / 522 » Computational Probabilistic Non-interference |
126
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Rapid growth in the amount of data available on social networking sites has made information retrieval increasingly challenging for users. In this paper, we propose a collaborativ...
122
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
STOC
2002
ACM
16 years 27 days ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
185
click to vote
VLDB
2007
ACM
16 years 25 days ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
189
click to vote
VLDB
2009
ACM
16 years 25 days ago
2009
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...