Sciweavers

11211 search results - page 2011 / 2243
» Rank-Sensitive Data Structures
Sort
View
140
Voted
VISUALIZATION
1998
IEEE
15 years 7 months ago
Smooth view-dependent level-of-detail control and its application to terrain rendering
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...
Hugues Hoppe
127
Voted
ICFP
1998
ACM
15 years 7 months ago
Intensional Polymorphism in Type-Erasure Semantics
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...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
168
Voted
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 7 months ago
A Cost Model for Similarity Queries in Metric Spaces
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 ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
128
Voted
WOSP
1998
ACM
15 years 7 months ago
Predicting memory use from a class diagram using dynamic information
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...
Gail C. Murphy, Ekaterina Saenko
118
Voted
ECOOP
1998
Springer
15 years 7 months ago
The Complexity of Type Analysis of Object Oriented Programs
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...
Joseph Gil, Alon Itai
« Prev « First page 2011 / 2243 Last » Next »