Sciweavers

727 search results - page 94 / 146
» One line and n points
Sort
View
IOR
2008
91views more  IOR 2008»
14 years 10 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
81
Voted
ACISP
2000
Springer
15 years 2 months ago
Cryptanalysis of the m-Permutation Protection Schemes
Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP'98, Fung and Gray proposed an −m permutation protecti...
Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng

Publication
1147views
16 years 8 months ago
PDE-based fast local level set method
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...
Danping Peng, Barry Merriman, Stanley Osher, Hongk...
EUROGRAPHICS
2010
Eurographics
15 years 5 months ago
Practical quad mesh simplification
n this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. T...
Marco Tarini, Nico Pietroni, Paolo Cignoni, Daniel...
FOCS
2006
IEEE
15 years 4 months ago
Better lossless condensers through derandomized curve samplers
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
Amnon Ta-Shma, Christopher Umans