1127 search results - page 97 / 226 » Improving Data Locality by Chunking |
149
click to vote
VISUALIZATION
2000
IEEE
15 years 8 months ago
2000
IEEE
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
116
click to vote
NIPS
2007
15 years 5 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
128
Voted
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...
123
click to vote
ANCS
2009
ACM
15 years 1 months ago
2009
ACM
We propose MCRingBuffer, a lock-free, cache-efficient shared ring buffer that provides fast data accesses among threads running in multi-core architectures. MCRingBuffer seeks to ...
141
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— Learning inverse kinematics has long been fascinating the robot learning community. While humans acquire this transformation to complicated tool spaces with ease, it is...