Sciweavers

11231 search results - page 1963 / 2247
» Digging for Data Structures
Sort
View
169
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
129
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
120
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
137
Voted
EDBT
1998
ACM
114views Database» more  EDBT 1998»
15 years 7 months ago
HySpirit - A Probabilistic Inference Engine for Hypermedia Retrieval in Large Databases
Abstract. HySpirit is a retrieval engine for hypermedia retrieval integrating concepts from information retrieval (IR) and deductive databases. The logical view on IR models retrie...
Norbert Fuhr, Thomas Rölleke
144
Voted
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 7 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
« Prev « First page 1963 / 2247 Last » Next »