11394 search results - page 324 / 2279 » Error-Correcting Data Structures |
117
click to vote
CGF
2002
15 years 4 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
166
click to vote
ILP
1999
Springer
15 years 8 months ago
1999
Springer
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
145
click to vote
ESCIENCE
2007
IEEE
15 years 10 months ago
2007
IEEE
In federated Data Grids, individual institutions share their data sets within a community to enable collaborative data analysis. Data access needs to be provided in a scalable fas...
130
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
174
click to vote
ALENEX
2001
15 years 5 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...