1826 search results - page 281 / 366 » Controlling data movement in global computing applications |
123
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
GG
2004
Springer
15 years 9 months ago
2004
Springer
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules incl...
185
click to vote
ITRUST
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Past evidence has shown that generic approaches to recommender systems based upon collaborative filtering tend to poorly scale. Moreover, their fitness for scenarios su...
119
click to vote
DELOS
2007
15 years 5 months ago
2007
The similarity search has become a fundamental computational task in many applications. One of the mathematical models of the similarity – the metric space – has drawn attenti...
133
click to vote
EGH
2005
Springer
15 years 9 months ago
2005
Springer
The growing application of user-defined programs within graphics processing units (GPUs) has transformed the fixed-function display pipeline into a largely programmable pipeline...