340 search results - page 37 / 68 » A New Algorithm for the Construction of Optimal B-Trees |
WAIM
2007
Springer
14 years 1 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
EMO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
MICRO
2009
IEEE
14 years 2 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...