16430 search results - page 775 / 3286 » On Computable Tree Functions |
192
click to vote
VLDB
2004
ACM
16 years 26 days ago
2004
ACM
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
215
click to vote
EUROCRYPT
2010
Springer
16 years 9 days ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
191
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
190
click to vote
GLVLSI
2009
IEEE
15 years 11 months ago
2009
IEEE
Mounting concerns over variability, defects and noise motivate a new approach for integrated circuits: the design of stochastic logic, that is to say, digital circuitry that opera...
157
click to vote
ECIR
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...