10608 search results - page 81 / 2122 » Complexity of O'Hara's Algorithm |
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
COMPGEOM
2005
ACM
13 years 12 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
DCG
2008
13 years 10 months ago
2008
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...