Sciweavers

11160 search results - page 396 / 2232
» Incompleteness in a General Setting
Sort
View
RSCTC
2000
Springer
146views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts
Abstract. We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relation...
Maciej Borkowski, Dominik Slezak
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 8 months ago
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
Aaron Roth
DAGSTUHL
2006
15 years 8 months ago
Multisource Algorithmic Information Theory
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
Alexander Shen
ACS
2010
15 years 7 months ago
Lawvere Completion and Separation Via Closure
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
Dirk Hofmann, Walter Tholen
CORR
2010
Springer
73views Education» more  CORR 2010»
15 years 7 months ago
Exponential Family Hybrid Semi-Supervised Learning
We present an approach to semi-supervised learning based on an exponential family characterization. Our approach generalizes previous work on coupled priors for hybrid generative/...
Arvind Agarwal, Hal Daumé III