2720 search results - page 25 / 544 » How do we count |
EDBT
2009
ACM
14 years 1 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...
SELMAS
2005
Springer
14 years 3 months ago
2005
Springer
Despite the relevance of the concept of role for conceptual modeling and agent-orientation, there is still in the literature a lack of consensus on the meaning of this notion and h...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ICICS
2005
Springer
14 years 3 months ago
2005
Springer
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
CP
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...