10988 search results - page 135 / 2198 » Algorithmic Folding Complexity |
137
Voted
SMA
2003
ACM
15 years 7 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
130
Voted
ATAL
2007
Springer
15 years 8 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...
142
Voted
COMPGEOM
2005
ACM
15 years 4 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...
216
Voted
ICDT
2009
ACM
16 years 3 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...
121
Voted
COMPGEOM
2009
ACM
15 years 7 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 ...