Sciweavers

1679 search results - page 64 / 336
» Pointcuts as Functional Queries
Sort
View
114
Voted
SOFTWARE
2002
15 years 13 days ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 7 months ago
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
Amos Beimel, Kobbi Nissim, Eran Omri
112
Voted
IANDC
2006
102views more  IANDC 2006»
15 years 23 days ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 5 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
SSDBM
2008
IEEE
181views Database» more  SSDBM 2008»
15 years 7 months ago
Monitoring Aggregate k-NN Objects in Road Networks
Abstract. In recent years, there is an increasing need to monitor k nearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a...
Lu Qin, Jeffrey Xu Yu, Bolin Ding, Yoshiharu Ishik...