Sciweavers

485 search results - page 78 / 97
» Iterative Bounding LAO
Sort
View
HIPEAC
2005
Springer
15 years 3 months ago
Enhancing Network Processor Simulation Speed with Statistical Input Sampling
Abstract. While cycle-accurate simulation tools have been widely used in modeling high-performance processors, such an approach can be hindered by the increasing complexity of the ...
Jia Yu, Jun Yang 0002, Shaojie Chen, Yan Luo, Laxm...
TLCA
2005
Springer
15 years 3 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
CONCUR
2004
Springer
15 years 3 months ago
Type Based Discretionary Access Control
Abstract. Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of ...
Michele Bugliesi, Dario Colazzo, Silvia Crafa
115
Voted
ESAS
2004
Springer
15 years 3 months ago
Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
Mark Manulis, Jörg Schwenk
INFOCOM
2003
IEEE
15 years 3 months ago
Energy Efficient Routing in Ad Hoc Disaster Recovery Networks
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...
Gil Zussman, Adrian Segall