Sciweavers

1274 search results - page 53 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
COCOA
2008
Springer
13 years 11 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor
COMPGEOM
2004
ACM
14 years 3 months ago
Towards in-place geometric algorithms and data structures
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Hervé Brönnimann, Timothy M. Chan, Eri...
COMPGEOM
2004
ACM
14 years 3 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
CVPR
2005
IEEE
15 years 3 hour ago
Scene-Adapted Structured Light
In order to overcome several limitations of structured light 3D acquisition methods, the colors, intensities, and shapes of the projected patterns are adapted to the scene. Based ...
Thomas P. Koninckx, Pieter Peers, Philip Dutr&eacu...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle