Sciweavers

406 search results - page 6 / 82
» Fast Increment Registers
Sort
View
POPL
2003
ACM
14 years 10 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
PLDI
2006
ACM
14 years 3 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
CGO
2005
IEEE
14 years 3 months ago
A Progressive Register Allocator for Irregular Architectures
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
David Koes, Seth Copen Goldstein
ACL
2007
13 years 11 months ago
Fast Unsupervised Incremental Parsing
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structur...
Yoav Seginer
JMLR
2006
131views more  JMLR 2006»
13 years 9 months ago
Incremental Support Vector Learning: Analysis, Implementation and Applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM ...
Pavel Laskov, Christian Gehl, Stefan Krüger, ...