265 search results - page 46 / 53 » How Many Query Superpositions Are Needed to Learn |
PKC
2009
Springer
14 years 8 months ago
2009
Springer
In this work, we consider the task of allowing a content provider to enforce complex access control policies on oblivious protocols conducted with anonymous users. As our primary ...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
AGILEDC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper describes the authors’ experiences creating a full Build Management System from a simple Version Control System. We will explore how the XP values of simplicity, feed...