Sciweavers

1173 search results - page 90 / 235
» On the Compositionality of Round Abstraction
Sort
View
JNS
2007
68views more  JNS 2007»
15 years 6 months ago
Single Droplet Pattern in the Cylindrical Phase of Diblock Copolymer Morphology
The Ohta-Kawasaki density functional theory of diblock copolymers gives rise to a nonlocal free boundary problem. Under a proper condition between the block composition fraction a...
X. Ren, J. Wei
TIFS
2010
132views more  TIFS 2010»
15 years 4 months ago
JPEG error analysis and its applications to digital image forensics
JPEG is one of the most extensively used image formats. Understanding the inherent characteristics of JPEG may play a useful role in digital image forensics. In this paper, we int...
Weiqi Luo, Jiwu Huang, Guoping Qiu
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
TC
2011
15 years 1 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
KBSE
1999
IEEE
15 years 10 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi