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...
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
We present a novel method for vision-based recovery of three-dimensional structures through simultaneous model reconstruction and camera position tracking from monocular images. O...
Oliver Ruepp, Darius Burschka, Robert Bauernschmit...
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatia...
Abstract. In unstructured peer-to-peer networks, as in real life, a good neighbourhood is not only crucial for a peaceful sleep, but also for an exchange of important gossips and f...
Ivan Martinovic, Christof Leng, Frank A. Zdarsky, ...