Sciweavers

709 search results - page 102 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
DEXA
2006
Springer
80views Database» more  DEXA 2006»
15 years 9 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
BDA
2006
15 years 7 months ago
Matching Algorithms for User Notification in Digital Libraries
We consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the ...
Hanen Belhaj Frej, Philippe Rigaux, Nicolas Spyrat...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
On the Implementation of the Probabilistic Logic Programming Language ProbLog
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
Angelika Kimmig, Bart Demoen, Luc De Raedt, V&iacu...
174
Voted
VLDB
1989
ACM
104views Database» more  VLDB 1989»
15 years 10 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi
ECAI
2008
Springer
15 years 7 months ago
Extending the Knowledge Compilation Map: Closure Principles
We extend the knowledge compilation map introduced by Darwiche and Marquis with new propositional fragments obtained by applying closure principles to several fragments studied so...
Hélène Fargier, Pierre Marquis