11211 search results - page 116 / 2243 » Rank-Sensitive Data Structures |
81
Voted
IBERAMIA
2004
Springer
15 years 6 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...
112
click to vote
VISUALIZATION
1992
IEEE
15 years 4 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...
199
click to vote
ICDE
2007
IEEE
16 years 2 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...
105
Voted
GFKL
2004
Springer
15 years 6 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...
106
Voted
IJCNLP
2004
Springer
15 years 6 months ago
2004
Springer
Multi-document discourse analysis has emerged with the potential of improving various NLP applications. Based on the newly proposed Cross-document Structure Theory (CST), this pap...