Sciweavers

2585 search results - page 116 / 517
» computing 1999
Sort
View
EWLR
1997
Springer
15 years 7 months ago
Learning Complex Robot Behaviours by Evolutionary Computing with Task Decomposition
Building robots can be a tough job because the designer has to predict the interactions between the robot and the environment as well as to deal with them. One solution to cope the...
Wei-Po Lee, John Hallam, Henrik Hautop Lund
3DIM
1999
IEEE
15 years 7 months ago
Computing Consistent Normals and Colors from Photometric Data
We present a method for computing normals and colors from multiple sets of photometric data, that are consistent with each other and an underlying lower resolution mesh. Normals a...
Holly E. Rushmeier, Fausto Bernardini
87
Voted
ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
15 years 7 months ago
How Fast Can We Compute Products?
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
ICIP
1999
IEEE
16 years 5 months ago
Computing Isotropic Local Contrast from Oriented Pyramid Decompositions
Working with contrast instead of luminance can facilitate numerous image processing and analysis tasks. Unfortunately, a common definition of contrast suitable for all situations ...
Stefan Winkler, Pierre Vandergheynst
172
Voted
COMPGEOM
1999
ACM
15 years 7 months ago
H-Walk: Hierarchical Distance Computation for Moving Convex Bodies
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
Leonidas J. Guibas, David Hsu, Li Zhang