Sciweavers

221 search results - page 19 / 45
» Efficient sampling of random permutations
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 8 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
ICIP
2005
IEEE
14 years 9 months ago
Two-channel predictive multiple description coding
This paper presents a multiple description (MD) video codec based on the principles side-information coding. In particular, we highlight certain key components of the codec design...
Ashish Jagmohan, Anshul Sehgal, Narendra Ahuja
WSC
2004
13 years 9 months ago
Quasi-Monte Carlo Methods in Finance
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
Pierre L'Ecuyer
BMCBI
2010
124views more  BMCBI 2010»
13 years 8 months ago
Estimating time since infection in early homogeneous HIV-1 samples using a poisson model
Background: The occurrence of a genetic bottleneck in HIV sexual or mother-to-infant transmission has been well documented. This results in a majority of new infections being homo...
Elena E. Giorgi, Bob Funkhouser, Gayathri Athreya,...
ASIACRYPT
2008
Springer
13 years 10 months ago
Chosen Ciphertext Security with Optimal Ciphertext Overhead
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto