1054 search results - page 187 / 211 » Fast Approximated SIFT |
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
VISUALIZATION
1998
IEEE
15 years 1 months ago
1998
IEEE
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
VISUALIZATION
1996
IEEE
15 years 1 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
VISUALIZATION
1991
IEEE
15 years 1 months ago
1991
IEEE
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...