34 search results - page 6 / 7 » Recursion Pruning for the Apriori Algorithm |
129
click to vote
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
A comprehensive probabilistic methodology is proposed to solve the buffer insertion problem with the consideration of process variations. In contrast to a recent work, we point o...
140
click to vote
ADBIS
2003
Springer
15 years 10 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
185
click to vote
DASFAA
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
169
click to vote
JUCS
2010
15 years 3 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
166
click to vote
ISCI
2007
15 years 4 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...