Sciweavers

73 search results - page 3 / 15
» Least Generalization under Relative Implication
Sort
View
ALT
2011
Springer
12 years 7 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
PODS
2004
ACM
139views Database» more  PODS 2004»
14 years 7 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
ECRA
2007
113views more  ECRA 2007»
13 years 7 months ago
Exclusions and related trust relationships in multi-party fair exchange protocols
Some electronic commerce transactions are inherently performed between more than two parties. In this context, it is thus important to determine whether the underlying fair exchan...
Nicolás González-Deleito, Olivier Ma...
ALT
1999
Springer
13 years 11 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
FQAS
2006
Springer
186views Database» more  FQAS 2006»
13 years 11 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen