Sciweavers

9209 search results - page 81 / 1842
» Data Space Randomization
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 6 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
187
Voted
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 6 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
124
Voted
IPPS
2010
IEEE
15 years 12 days ago
Reconciling scratch space consumption, exposure, and volatility to achieve timely staging of job input data
Innovative scientific applications and emerging dense data sources are creating a data deluge for highend computing systems. Processing such large input data typically involves cop...
Henry M. Monti, Ali Raza Butt, Sudharshan S. Vazhk...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 2 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 7 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...