11211 search results - page 2064 / 2243 » Rank-Sensitive Data Structures |
114
click to vote
ISKO
1997
15 years 4 months ago
1997
This paper was prepared for a lecture at a recent meeting of the German Chapter of ISKO devoted to Wissensorganisation mit Multimedialen Techniken [Knowledge Organization with Mul...
124
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
171
click to vote
SPLC
2000
15 years 4 months ago
2000
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...
147
click to vote
UAI
2000
15 years 4 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
107
click to vote
WEBNET
2000
15 years 4 months ago
2000
The Resource Description Framework [RDF] provides a basic model to describe relationships between objects. Ultimately, it is intended to permit the representation, combination and ...