Sciweavers

247 search results - page 15 / 50
» Ideals without CCC
Sort
View
IPL
2008
118views more  IPL 2008»
13 years 7 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
JCT
2008
81views more  JCT 2008»
13 years 7 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
SOSP
2003
ACM
14 years 4 months ago
Xen and the art of virtualization
Numerous systems have been designed which use virtualization to subdivide the ample resources of a modern computer. Some require specialized hardware, or cannot support commodity ...
Paul Barham, Boris Dragovic, Keir Fraser, Steven H...
ASIACRYPT
2009
Springer
14 years 1 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
KCAP
2009
ACM
14 years 1 months ago
Interactively shaping agents via human reinforcement: the TAMER framework
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
W. Bradley Knox, Peter Stone