Sciweavers

11213 search results - page 12 / 2243
» Low-contention data structures
Sort
View
DKE
1998
88views more  DKE 1998»
15 years 2 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
106
Voted
TIT
1998
80views more  TIT 1998»
15 years 2 months ago
Structural Risk Minimization Over Data-Dependent Hierarchies
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
John Shawe-Taylor, Peter L. Bartlett, Robert C. Wi...
135
Voted
MICRO
2010
IEEE
242views Hardware» more  MICRO 2010»
15 years 15 days ago
ASF: AMD64 Extension for Lock-Free Data Structures and Transactional Memory
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory. It provides a speculative region that atomically exec...
Jae-Woong Chung, Luke Yen, Stephan Diestelhorst, M...
162
Voted
PPOPP
2011
ACM
14 years 5 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
109
Voted
ENTCS
2000
154views more  ENTCS 2000»
15 years 2 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill