2652 search results - page 112 / 531 » Privacy-preserving linear programming |
146
click to vote
TIT
2010
14 years 9 months ago
2010
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
128
click to vote
SIAMJO
2011
14 years 10 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
111
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
102
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
136
click to vote
WEA
2009
Springer
15 years 10 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...