Buscar
Mostrando ítems 1-10 de 548
Explaining Query Answers in Probabilistic Databases
Probabilistic databases have emerged as an extension of relational databases that can handle uncertain data under possible worlds semantics. Although the problems of creating effective means of probabilistic data representation ...
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases
(Association for Computing Machineryacmhelp@acm.org, 2020)
Probabilistic Latent Semantic Analyses (PLSA) in Bibliometric Analysis for Technology Forecasting
(Universidad Alberto Hurtado. Facultad de Economía y Negocios, 2014)
Preference-Based Query Answering in Probabilistic Datalog+/– Ontologies
(Springer Verlag Berlín, 2015-06)
The incorporation of preferences into information systems, such as databases, has recently seen a surge in interest, mainly fueled by the revolution in Web data availability. Modeling the preferences of a user on the Web ...
On the least cost for proximity searching in metric spaces
(SPRINGER-VERLAG BERLIN, 2006)
Proximity searching consists in retrieving from a database those elements that are similar to a query. As the distance is usually expensive to compute, the goal is to use as few distance computations as possible to satisfy ...
A fast probabilistic model for hypothesis rejection in SIFT-based object recognition
(SPRINGER-VERLAG BERLIN, 2006)
This paper proposes an improvement over the traditional SIFT-based object recognition methodology proposed by Lowe [3]. This improvement corresponds to a fast probabilistic model for hypothesis rejection (affine solution ...