Sciweavers

3891 search results - page 31 / 779
» Query Models
Sort
View
DAGSTUHL
2006
13 years 11 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
AI
2010
Springer
13 years 10 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini
OTM
2005
Springer
14 years 3 months ago
Object-Oriented Wrapper for Relational Databases in the Data Grid Architecture
: The paper presents a solution of the problem of wrapping relational databases to an object-oriented business model in the data grid architecture. The main problem with this kind ...
Kamil Kuliberda, Jacek Wislicki, Radoslaw Adamus, ...
COOPIS
1997
IEEE
14 years 2 months ago
Query Modification in Object-Oriented Database Federations
W e discuss the modification of queries against an integrated view in a federation of object-oriented databases. W epresent a generalisation of existing algorithms for simple glob...
Mark W. W. Vermeer, Peter M. G. Apers
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 2 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman