4886 search results - page 433 / 978 » Approximate Data Exchange |
176
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
177
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
166
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
212
click to vote
CIDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
163
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...