2219 search results - page 187 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
131
click to vote
IEEECIT
2009
IEEE
15 years 22 days ago
2009
IEEE
Abstract--The size, heterogeneity and dynamism of the execution platforms of scientific applications, like computational grids, make using those platforms complex. Furthermore, tod...
136
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
140
click to vote
WWW
2003
ACM
16 years 3 months ago
2003
ACM
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
129
click to vote
ECOOP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
143
click to vote
PPOPP
1999
ACM
15 years 7 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...