Sciweavers

1301 search results - page 107 / 261
» Specifications via Realizability
Sort
View
137
Voted
ESORICS
2008
Springer
15 years 5 months ago
Cryptographic Protocol Explication and End-Point Projection
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
Jay A. McCarthy, Shriram Krishnamurthi
129
Voted
ANCS
2007
ACM
15 years 7 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
131
Voted
CASES
2006
ACM
15 years 7 months ago
Probabilistic arithmetic and energy efficient embedded signal processing
Probabilistic arithmetic, where the ith output bit of addition and multiplication is correct with a probability pi, is shown to be a vehicle for realizing extremely energy-efficie...
Jason George, B. Marr, Bilge E. S. Akgul, Krishna ...
152
Voted
ADHOC
2008
88views more  ADHOC 2008»
15 years 3 months ago
Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking
As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper...
Shu Du, Ahamed Khan, Santashil PalChaudhuri, Ansle...
139
Voted
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 11 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...