Sciweavers

11394 search results - page 84 / 2279
» Error-Correcting Data Structures
Sort
View
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 5 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
NAR
2011
214views Computer Vision» more  NAR 2011»
14 years 2 months ago
IEDB-3D: structural data within the immune epitope database
IEDB-3D is the 3D structural component of the Immune Epitope Database (IEDB) available via the ‘Browse by 3D Structure’ page at http://www.iedb .org. IEDB-3D catalogs B- and T...
Julia V. Ponomarenko, Nikitas Papangelopoulos, Dir...
WDAS
2000
15 years 1 months ago
Scalable Distributed Data Structures for High-Performance Databases
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...
PKDD
1999
Springer
90views Data Mining» more  PKDD 1999»
15 years 4 months ago
Learning from Highly Structured Data by Decomposition
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
René MacKinney-Romero, Christophe G. Giraud...
PLDI
2012
ACM
13 years 2 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...