Sciweavers

2497 search results - page 379 / 500
» Requirements for models of achievable routing
Sort
View
CORR
2010
Springer
123views Education» more  CORR 2010»
15 years 1 months ago
A Peer-to-Peer Middleware Framework for Resilient Persistent Programming
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
14 years 1 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
MICCAI
2004
Springer
16 years 2 months ago
Enhancement of Visual Realism with BRDF for Patient Specific Bronchoscopy Simulation
Abstract. This paper presents a novel method for photorealistic rendering of the bronchial lumen by directly deriving matched shading and texture parameters from video bronchoscope...
Adrian James Chung, Fani Deligianni, Pallav Shah, ...
WWW
2009
ACM
16 years 2 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel
109
Voted
FM
2005
Springer
98views Formal Methods» more  FM 2005»
15 years 7 months ago
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...
Richard Banach, Michael Poppleton, Czeslaw Jeske, ...