Sciweavers

54 search results - page 3 / 11
» Some properties of the disjunctive languages contained in Q
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 3 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
ICIP
1998
IEEE
14 years 7 months ago
Recognizing Surfaces from 3D Curves
;I general paradigm for recognizing 3D objects is offered, and applied to some geometric primitives [sphe,res, cylinders, cones, and tori). The assumption is that Q curve on the s...
Daniel Keren, Ehud Rivlin, Ilan Shimshoni, Isaac W...
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 6 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 5 months ago
Separations of Matroid Freeness Properties
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
Arnab Bhattacharyya, Elena Grigorescu, Jakob Nords...
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 5 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen