Sciweavers

789 search results - page 120 / 158
» On Theory Revision with Queries
Sort
View
115
Voted
SEMWEB
2010
Springer
14 years 10 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
103
Voted
JMLR
2010
165views more  JMLR 2010»
14 years 7 months ago
Causal Inference
: This review presents empirical researchers with recent advances in causal inference, and stresses the paradigmatic shifts that must be undertaken in moving from traditional stati...
Judea Pearl
105
Voted
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 1 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
117
Voted
AICOM
2004
118views more  AICOM 2004»
15 years 17 days ago
Qualitative pattern matching with linguistic terms
Abstract. In the framework of possibility theory, a tool named `fuzzy pattern matching' (FPM) has been proposed in the eighties and since successfully used in flexible queryin...
Yannick Loiseau, Henri Prade, Mohand Boughanem
IACR
2011
106views more  IACR 2011»
14 years 10 days ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel