Sciweavers

503 search results - page 83 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
TII
2008
98views more  TII 2008»
14 years 9 months ago
Formal Methods for Systems Engineering Behavior Models
Abstract--Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however power...
Charlotte Seidner, Olivier H. Roux
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
VLDB
2004
ACM
106views Database» more  VLDB 2004»
15 years 3 months ago
On The Marriage of Lp-norms and Edit Distance
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
Lei Chen 0002, Raymond T. Ng
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
14 years 9 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
15 years 10 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais