Sciweavers

2634 search results - page 60 / 527
» Faster Than Uppaal
Sort
View
ASPLOS
1998
ACM
14 years 1 months ago
Segregating Heap Objects by Reference Behavior and Lifetime
Dynamic storage allocation has become increasingly important in many applications, in part due to the use of the object-oriented paradigm. At the same time, processor speeds are i...
Matthew L. Seidl, Benjamin G. Zorn
ISCA
1997
IEEE
96views Hardware» more  ISCA 1997»
14 years 1 months ago
DataScalar Architectures
DataScalar architectures improve memory system performance by running computation redundantly across multiple processors, which are each tightly coupled with an associated memory....
Doug Burger, Stefanos Kaxiras, James R. Goodman
PLDI
1990
ACM
14 years 26 days ago
Representing Control in the Presence of First-Class Continuations
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
Robert Hieb, R. Kent Dybvig, Carl Bruggeman
ASIACRYPT
2007
Springer
14 years 25 days ago
On Efficient Message Authentication Via Block Cipher Design Techniques
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
Goce Jakimoski, K. P. Subbalakshmi
ANNPR
2006
Springer
14 years 17 days ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe