713 search results - page 63 / 143 » Saving Space by Algebraization |
165
click to vote
CASCON
1996
15 years 7 months ago
1996
A memory-adaptive sort is able to dynamically change the amount of memory used during sorting. The method described in this paper adjusts memory usage according to input size and ...
177
click to vote
COLING
1990
15 years 7 months ago
1990
':[his paper describes a rule-based machine learning approach to morphological processing in the system called XMAS. XMAS discovers and acquires linguistic rules from example...
158
click to vote
SPIN
2009
Springer
16 years 21 days ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
141
click to vote
SARA
2005
Springer
15 years 11 months ago
2005
Springer
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
126
click to vote
SPIRE
2005
Springer
15 years 11 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...