11231 search results - page 1634 / 2247 » Digging for Data Structures |
278
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
211
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
184
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
193
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
188
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
The lowly state of the art for file system checking and repair does not match what is needed to keep important data available for users. Current file system checkers, such as e2fs...