Sciweavers

1672 search results - page 118 / 335
» Tightness problems in the plane
Sort
View
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
14 years 2 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...
INFORMS
1998
100views more  INFORMS 1998»
13 years 9 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
ICIP
2006
IEEE
14 years 11 months ago
Free-View Watermarking for Free-View Television
The recent advances in Image Based Rendering (IBR) has pioneered a new technology, free-view television, in which TVviewers select freely the viewing position and angle by the app...
Alper Koz, Cevahir Cigla, A. Aydin Alatan
COMPGEOM
2009
ACM
14 years 2 months ago
The scale axis picture show
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
Joachim Giesen, Balint Miklos, Mark Pauly, Camille...
GD
2009
Springer
14 years 2 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...