11214 search results - page 98 / 2243 » Just-in-time data structures |
IBERAMIA
2004
Springer
14 years 3 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
ECOOP
2012
Springer
12 years 15 days ago
2012
Springer
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
VISUALIZATION
1992
IEEE
14 years 2 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
GFKL
2004
Springer
14 years 3 months ago
2004
Springer
A hierarchical extension of the finite mixture model is presented that can be used for the analysis of nested data structures. The model permits a simultaneous model-based cluster...