329 search results - page 37 / 66 » On Range Searching with Semialgebraic Sets |
148
click to vote
ESA
2000
Springer
15 years 9 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...
153
Voted
EMO
2009
Springer
16 years 20 days ago
2009
Springer
A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of obje...
166
click to vote
SIGIR
2005
ACM
15 years 11 months ago
2005
ACM
Memory-based approaches for collaborative filtering identify the similarity between two users by comparing their ratings on a set of items. In the past, the memory-based approache...
179
click to vote
DATESO
2010
15 years 4 months ago
2010
Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
276
Voted
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we address the problem of organizing hidden-Web databases. Given a heterogeneous set of Web forms that serve as entry points to hidden-Web databases, our goal is to ...