9209 search results - page 86 / 1842 » Data Space Randomization |
121
Voted
VISUALIZATION
1996
IEEE
15 years 6 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
129
Voted
KDD
2001
ACM
16 years 2 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
128
Voted
SOSP
2005
ACM
15 years 11 months ago
2005
ACM
Disk performance is increasingly limited by its head positioning latencies, i.e., seek time and rotational delay. To reduce the head positioning latencies, we propose a novel tech...
135
click to vote
CHI
1993
ACM
15 years 6 months ago
1993
ACM
Multimodal interaction enables the user to employ different modalities such as voice, gesture and typing for communicating with a computer. This paper presents an analysis of the ...
106
click to vote
ESA
2010
Springer
15 years 2 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m