1458 search results - page 231 / 292 » Practical Preference Relations for Large Data Sets |
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
104
click to vote
ESA
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
117
click to vote
KAIS
2006
14 years 11 months ago
2006
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
129
click to vote
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
104
click to vote
OTM
2007
Springer
15 years 6 months ago
2007
Springer
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...