3171 search results - page 555 / 635 » Application of Reduce Order Modeling to Time Parallelization |
132
click to vote
MIDDLEWARE
2005
Springer
15 years 8 months ago
2005
Springer
The vision of pervasive or ubiquitous computing, conceived by Mark Weiser, foresees a world where computing is embedded in every day objects. Such objects interact with each other...
145
click to vote
TCC
2012
Springer
13 years 10 months ago
2012
Springer
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
131
click to vote
ATVA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
142
click to vote
EDBT
2010
ACM
15 years 1 months ago
2010
ACM
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
130
click to vote
COLT
1993
Springer
15 years 7 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...