Sciweavers

9425 search results - page 1755 / 1885
» Some Notes on Models and Modelling
Sort
View
PODC
2009
ACM
16 years 2 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
HPCA
2009
IEEE
16 years 2 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
119
Voted
TCC
2009
Springer
116views Cryptology» more  TCC 2009»
16 years 2 months ago
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
16 years 2 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 2 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
« Prev « First page 1755 / 1885 Last » Next »