11211 search results - page 2011 / 2243 » Rank-Sensitive Data Structures |
170
click to vote
VISUALIZATION
1998
IEEE
15 years 10 months ago
1998
IEEE
The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address...
159
click to vote
ICFP
1998
ACM
15 years 10 months ago
1998
ACM
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
210
click to vote
PODS
1998
ACM
15 years 10 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
160
click to vote
WOSP
1998
ACM
15 years 10 months ago
1998
ACM
Increasingly, new applications are being built by composing existing software components rather than by coding a system from scratch. Using this approach, applications can be buil...
156
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...