Sciweavers

3991 search results - page 278 / 799
» Bounding homogeneous models
Sort
View
277
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Analysis of the security of linear blinding techniques from an information theoretical point of view
We propose a novel model to characterize the security of linear blinding techniques. The proposed model relates the security of blinding to the possibility of estimating the blind...
Tiziano Bianchi, Alessandro Piva, Mauro Barni
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
14 years 2 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
PE
2010
Springer
212views Optimization» more  PE 2010»
15 years 1 months ago
Modeling TCP throughput: An elaborated large-deviations-based model and its empirical validation
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
Patrick Loiseau, Paulo Gonçalves, Julien Ba...
SPAA
1995
ACM
15 years 10 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
ISTCS
1992
Springer
15 years 10 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit