548 search results - page 76 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
104
click to vote
GIS
1999
ACM
15 years 6 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
115
click to vote
FOCS
2000
IEEE
15 years 6 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 ...
124
click to vote
BIS
2009
15 years 3 months ago
2009
The field of Semantic Business Process Management (SBPM) has refuelled interest in using ontologies for the representation of the static and dynamic aspects of an enterprise and va...
102
click to vote
ICCAD
2004
IEEE
15 years 11 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
110
click to vote
BNCOD
2004
15 years 3 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...