Sciweavers

4880 search results - page 321 / 976
» Manuals as Structured Programs
Sort
View
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
15 years 10 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
BMCBI
2010
146views more  BMCBI 2010»
15 years 5 months ago
A pairwise residue contact area-based mean force potential for discrimination of native protein structure
Background: Considering energy function to detect a correct protein fold from incorrect ones is very important for protein structure prediction and protein folding. Knowledge-base...
Shahriar Arab, Mehdi Sadeghi, Changiz Eslahchi, Ha...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 10 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
COMPGEOM
2003
ACM
15 years 10 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
139
Voted
HT
2000
ACM
15 years 9 months ago
Reusable hypertext structures for distance and JIT learning
Software components for distance and just-in-time (JIT) learning are an increasingly common method of encouraging reuse and facilitating the development process[58], but no analog...
Anne Morgan Spalter, Rosemary Michelle Simpson