We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
The paper presents a new steganographic method called LACK (Lost Audio PaCKets Steganography) which is intended mainly for VoIP. The method is presented in a broader context of net...
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
1 The article presents an online relevancy tuning method using explicit user feedback. The author developed and tested a method of words' weights modification based on search ...