2570 search results - page 164 / 514 » Fast Algorithms For The Computation Of Ranklets |
151
Voted
AROBOTS
2002
15 years 3 months ago
2002
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
93
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
156
click to vote
SI3D
1995
ACM
15 years 7 months ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
132
click to vote
JCB
2008
15 years 3 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
122
Voted
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...