ICDE
1992
IEEE
14 years 2 months ago
1992
IEEE
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...
SIGGRAPH
1993
ACM
14 years 2 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
SIGGRAPH
1993
ACM
14 years 2 months ago
1993
ACM
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
SAS
1994
Springer
14 years 2 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
PARA
1994
Springer
14 years 2 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
ORDAL
1994
14 years 2 months ago
1994
LCC
1994
14 years 2 months ago
1994
LCC
1994
14 years 2 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
LCC
1994
14 years 2 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
LCC
1994
14 years 2 months ago
1994
