Sciweavers

3096 search results - page 246 / 620
» The Generalized FITC Approximation
Sort
View
198
Voted
DCC
2011
IEEE
15 years 1 months ago
Accurate estimates of the data complexity and success probability for various cryptanalyses
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
Céline Blondeau, Benoît Gérard...
TIT
2010
137views Education» more  TIT 2010»
15 years 26 days ago
Channel coding rate in the finite blocklength regime
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...
Yury Polyanskiy, H. Vincent Poor, Sergio Verd&uacu...
COMPUTER
1999
69views more  COMPUTER 1999»
15 years 5 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
175
Voted
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
15 years 5 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
VC
1998
66views more  VC 1998»
15 years 5 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet