10182 search results - page 1921 / 2037 » Case Studies |
145
click to vote
EUROCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
149
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Illumina bead-based arrays are becoming increasingly popular due to their high degree of replication and reported high data quality. However, little attention has been...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
189
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
140
click to vote
PPOPP
2009
ACM
16 years 5 months ago
2009
ACM
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...