4747 search results - page 367 / 950 » Shuffle Memory System |
140
click to vote
LCTRTS
2004
Springer
15 years 11 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
132
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
embedded in a sliding-window scheme. Such exhaustive
search involves massive computation. Efficient Subwindow
Search (ESS) [11] avoids this by means of branch
and bound. However...
270
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Effective buffer management is crucial for efficient inmemory and streaming XQuery processing. We propose a buffer management scheme which combines static and dynamic analysis to ...
257
click to vote
CC
2009
Springer
16 years 6 months ago
2009
Springer
Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts spill code to move the values of variables b...
125
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper proposes a data encoder to reduce switched capacitance on system bus. Our method focuses on transferring raw video data (pixels) between off-chip memory and on-chip mem...