19 search results - page 4 / 4 » The Ordinary Line Problem Revisited |
129
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
136
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
125
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
140
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...