4463 search results - page 253 / 893 » computer 2000 |
148
click to vote
IPL
2000
15 years 6 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
145
click to vote
JGS
2000
15 years 6 months ago
2000
Spatial analysis mostly developed in an era when data was scarce and computational power was expensive. Consequently, traditional spatial analysis greatly simpli
152
click to vote
NDJFL
1998
15 years 6 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
178
click to vote
PARA
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In this article we present the results obtained from the execution of a commercial Computational Fluid Dynamics program on a cluster of personal computers. The communicat...
178
click to vote
IVC
2000
15 years 6 months ago
2000
This paper provides a review on techniques for computing a three-dimensional model of a scene from a single moving camera, with unconstrained motion and unknown parameters. In the...