Sciweavers

1672 search results - page 232 / 335
» Tightness problems in the plane
Sort
View
COMGEO
2011
ACM
14 years 6 months ago
Covering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...
CVPR
2011
IEEE
14 years 2 months ago
Multi-label Learning with Incomplete Class Assignments
We consider a special type of multi-label learning where class assignments of training examples are incomplete. As an example, an instance whose true class assignment is (c1, c2, ...
Serhat Bucak, Rong Jin, Anil Jain
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 2 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
ICCV
2011
IEEE
13 years 11 months ago
Realtime Multibody Visual SLAM with a Smoothly Moving Monocular Camera
This paper presents a realtime, incremental multibody visual SLAM system that allows choosing between full 3D reconstruction or simply tracking of the moving objects. Motion recon...
Abhijit Kundu, Madhava Krishna, C. V. Jawahar
FOCS
2008
IEEE
15 years 5 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...