11716 search results - page 373 / 2344 » Computable symbolic dynamics |
187
click to vote
EOR
2006
15 years 6 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
220
click to vote
SIBGRAPI
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular ...
372
click to vote
Presentation
Presented at 5th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2010), Lisbon, Portugal. August 16, 2010
178
click to vote
ISVD
2010
IEEE
15 years 5 months ago
2010
IEEE
—The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible...
182
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
The rapid progress of computers and today's heterogeneous computing environment means computation-intensive signal processing algorithms must be optimized for performance in ...