Sciweavers

1017 search results - page 22 / 204
» Register computations on ordinals
Sort
View
IICS
2009
Springer
14 years 2 months ago
Contributing and Socialization - Biaxial Segmentation for Users Generating Content
: User generated content is a valuable resource voluntarily provided by a growing number of users. As online and traditional businesses increasingly harness this resource the need ...
Hendrik Send, Daniel Michelis
POPL
2003
ACM
14 years 8 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
IEEEPACT
2009
IEEE
14 years 2 months ago
CPROB: Checkpoint Processing with Opportunistic Minimal Recovery
—CPR (Checkpoint Processing and Recovery) is a physical register management scheme that supports a larger instruction window and higher average IPC than conventional ROB-style re...
Andrew D. Hilton, Neeraj Eswaran, Amir Roth
MFCS
2001
Springer
14 years 2 days ago
Automata on Linear Orderings
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
Véronique Bruyère, Olivier Carton