958 search results - page 111 / 192 » Efficient data structures for range-aggregate queries on tre... |
KDD
2001
ACM
15 years 10 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
BTW
2007
Springer
15 years 2 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
DEBS
2007
ACM
14 years 11 months ago
2007
ACM
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...