52 search results - page 5 / 11 » Querying high-dimensional data in single-dimensional space |
104
click to vote
ADC
2003
Springer
15 years 7 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
135
click to vote
SISAP
2008
IEEE
15 years 8 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
125
Voted
EDBT
2006
ACM
16 years 1 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
132
Voted
DSMML
2004
Springer
15 years 7 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
105
click to vote
PODS
2000
ACM
15 years 5 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...