184 search results - page 20 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
162
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
JEA
2008
14 years 11 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
VISUALIZATION
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
121
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
109
click to vote
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...