2652 search results - page 473 / 531 » Privacy-preserving linear programming |
LATIN
2010
Springer
14 years 8 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
103
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
SIAMMAX
2010
14 years 4 months ago
2010
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
TIT
2010
14 years 4 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...