387 search results - page 3 / 78 » Towards in-place geometric algorithms and data structures |
89
Voted
FOCS
1992
IEEE
15 years 2 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
73
Voted
JCDCG
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
98
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a semi-supervised learning algorithm for discriminant analysis, which uses the geometric structure of both labeled and unlabeled samples and perform a manifold regulari...
99
Voted
COMGEO
1999
ACM
14 years 10 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
70
Voted
CVPR
2004
IEEE
16 years 8 days ago
2004
IEEE
We present a novel structure-enhancing adaptive filter guided by features derived from the Gradient Structure Tensor. We employ this filter to reduce noise in seismic data and to ...