Sciweavers

273 search results - page 50 / 55
» A Geometric Proof of Calibration
Sort
View
IJCV
2006
112views more  IJCV 2006»
13 years 8 months ago
Non-Single Viewpoint Catadioptric Cameras: Geometry and Analysis
Conventional vision systems and algorithms assume the imaging system to have a single viewpoint. However, these imaging systems need not always maintain a single viewpoint. For ins...
Rahul Swaminathan, Michael D. Grossberg, Shree K. ...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 8 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
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 8 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
ICDCS
2007
IEEE
14 years 2 months ago
Protocol Design for Dynamic Delaunay Triangulation
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to const...
Dong-Young Lee, Simon S. Lam
COMPGEOM
2006
ACM
14 years 2 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...