451 search results - page 6 / 91 » Some Lower Bounds on Geometric Separability Problems |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
14 years 9 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
STOC
2012
ACM
13 years 1 days ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
ALT
1998
Springer
15 years 1 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...