3020 search results - page 143 / 604 » Optimal partition trees |
159
click to vote
DATE
2006
IEEE
16 years 16 days ago
2006
IEEE
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
147
click to vote
LCPC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
161
click to vote
IPL
2008
15 years 6 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
196
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important featur...
213
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Many data-intensive websites use databases that grow much faster than the rate that users access the data. Such growing datasets lead to ever-increasing space and performance o...