Sciweavers

11160 search results - page 91 / 2232
» Incompleteness in a General Setting
Sort
View
AML
2010
91views more  AML 2010»
15 years 3 months ago
The limitations of cupping in the local structure of the enumeration degrees
Abstract We prove that a sequence of sets containing representatives of cupping partners for every nonzero 0 2 enumeration degree cannot have a 0 2 enumeration. We also prove that ...
Mariya Ivanova Soskova
CORR
2008
Springer
151views Education» more  CORR 2008»
15 years 3 months ago
Exact Matrix Completion via Convex Optimization
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
Emmanuel J. Candès, Benjamin Recht
JSYML
2006
62views more  JSYML 2006»
15 years 3 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller
SLOGICA
2011
14 years 10 months ago
Logics for Qualitative Inductive Generalization
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
Diderik Batens
COLT
2005
Springer
15 years 8 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon