Sciweavers

1070 search results - page 141 / 214
» Type Classes with Functional Dependencies
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 3 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
WWW
2011
ACM
13 years 3 months ago
An expressive mechanism for auctions on the web
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
Paul Dütting, Monika Henzinger, Ingmar Weber
TLCA
2009
Springer
14 years 3 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 3 months ago
Modeling Channel Occupancy Times for Voice Traffic in Cellular Networks
—Call holding times in telephony networks are commonly approximated by exponential distributions to facilitate traffic engineering. However, for traffic engineering of cellular n...
Emre A. Yavuz, Victor C. M. Leung
ASWSD
2004
Springer
14 years 2 months ago
On the Fault Hypothesis for a Safety-Critical Real-Time System
– A safety-critical real-time computer system must provide its services with a dependability that is much better than the dependability of any one of its constituent components. ...
Hermann Kopetz