Sciweavers

1274 search results - page 79 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
COMPGEOM
2007
ACM
14 years 2 months ago
Traversing a set of points with a minimum number of turns
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...
CAAN
2006
Springer
14 years 1 months ago
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
Guy Even, Shimon Shahar
COMPGEOM
2005
ACM
14 years 14 hour ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
COMPGEOM
2008
ACM
13 years 12 months ago
Extremal problems on triangle areas in two and three dimensions
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
ICIP
2007
IEEE
14 years 11 months ago
Fundamental Matrix Estimation Without Prior Match
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
Frédéric Sur, Marie-Odile Berger, Ni...