1101 search results - page 165 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
144
Voted
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
105
click to vote
KDD
2003
ACM
16 years 2 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
112
click to vote
KDD
2002
ACM
16 years 2 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
166
Voted
ICDT
2011
ACM
14 years 6 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
112
Voted
PODS
2000
ACM
15 years 6 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...