5169 search results - page 200 / 1034 » Locality approximation using time |
204
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
192
click to vote
APGV
2006
ACM
16 years 8 days ago
2006
ACM
Study of contrast sensitivity of the human eye shows that our contrast discrimination sensitivity follows the weber law for suprathreshold levels. In this paper, we apply this fac...
165
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
197
click to vote
ICRA
2000
IEEE
15 years 10 months ago
2000
IEEE
Much attention has been given to CONDENSATION methods for mobile robot localization. This has resulted in somewhat of a breakthrough in representing uncertainty for mobile robots....
168
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...