Sciweavers

11211 search results - page 11 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICST
2011
IEEE
14 years 4 months ago
Constraint-Based Program Debugging Using Data Structure Repair
—Developers have used data structure repair over the last few decades as an effective means to recover on-the-fly from errors in program state. Traditional repair techniques wer...
Muhammad Zubair Malik, Junaid Haroon Siddiqui, Sar...
DKE
1998
88views more  DKE 1998»
15 years 3 days 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
88
Voted
TIT
1998
80views more  TIT 1998»
15 years 2 days 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...
114
Voted
MICRO
2010
IEEE
242views Hardware» more  MICRO 2010»
14 years 10 months 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...
PPOPP
2011
ACM
14 years 3 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...