601 search results - page 107 / 121 » Lattice-based memory allocation |
CHI
2011
ACM
14 years 1 months ago
2011
ACM
Readers on the Web often skim through text to cope with the volume of available information. In a previous study [11] readers’ eye movements were tracked as they skimmed through...
131
click to vote
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
174
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
LCTRTS
2009
Springer
15 years 4 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...