779 search results - page 91 / 156 » Algorithms for the Sample Mean of Graphs |
162
click to vote
CODES
2010
IEEE
15 years 2 months ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
126
click to vote
ASPDAC
2006
ACM
15 years 10 months ago
2006
ACM
— This work develops an analytic framework for clock tree analysis considering process variations that is shown to correspond well with Monte Carlo results. The analysis framewor...
119
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
152
click to vote
PG
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper describes a two pass algorithm capable of computing solutions to the global illumination in general environments (diffuse or glossy surfaces, anisotropically scattering...
PR
2006
15 years 4 months ago
2006
In this paper, we present counterarguments against the direct LDA algorithm (D-LDA), which was previously claimed to be equivalent to Linear Discriminant Analysis (LDA). We show f...