1604 search results - page 163 / 321 » Regularization on Discrete Spaces |
145
Voted
3DIM
2005
IEEE
15 years 9 months ago
2005
IEEE
We compare two transform-based indexing methods for retrieval of 3D objects. We apply 3D Discrete Fourier Transform (DFT) and 3D Radial Cosine Transform (RCT) to the voxelized dat...
123
Voted
ICTAI
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
127
Voted
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
130
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
123
Voted
COMPGEOM
1991
ACM
15 years 7 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...