Sciweavers

1675 search results - page 77 / 335
» The Value of a Good Name
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 9 months ago
Convex Relaxations for Subset Selection
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...
MP
2006
121views more  MP 2006»
13 years 8 months ago
Approximate fixed-rank closures of covering problems
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 ...
Daniel Bienstock, Mark Zuckerberg
BMVC
2010
13 years 6 months ago
Towards On-Line Intensity-Based Surface Recovery from Monocular Images
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...
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
14 years 2 months ago
Parameter-Free Spatial Data Mining Using MDL
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...
Spiros Papadimitriou, Aristides Gionis, Panayiotis...
EURONGI
2006
Springer
14 years 16 days ago
Self-protection in P2P Networks: Choosing the Right Neighbourhood
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, ...