Sciweavers

298 search results - page 52 / 60
» ideal 2010
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 1 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
PDP
2010
IEEE
15 years 1 months ago
Malleable-Lab: A Tool for Evaluating Adaptive Online Schedulers on Malleable Jobs
—The emergence of multi-core computers has led to explosive development of parallel applications and hence the need of efficient schedulers for parallel jobs. Adaptive online sc...
Yangjie Cao, Hongyang Sun, Wen-Jing Hsu, Depei Qia...
85
Voted
PKC
2010
Springer
150views Cryptology» more  PKC 2010»
15 years 1 months ago
Security of Encryption Schemes in Weakened Random Oracle Models
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, K...
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
15 years 1 months ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...
ICDCS
2010
IEEE
15 years 1 months ago
A Hybrid Approach to High Availability in Stream Processing Systems
Abstract—Stream processing is widely used by today’s applications such as financial data analysis and disaster response. In distributed stream processing systems, machine fail...
Zhe Zhang, Yu Gu, Fan Ye, Hao Yang, Minkyong Kim, ...