Sciweavers

5084 search results - page 228 / 1017
» Proving Possibility Properties
Sort
View
JCS
2010
121views more  JCS 2010»
15 years 5 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 4 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
SIAMNUM
2010
129views more  SIAMNUM 2010»
15 years 1 months ago
Convergence of an Adaptive Finite Element Method for Controlling Local Energy Errors
A number of works concerning rigorous convergence theory for adaptive finite element methods (AFEM) for controlling global energy errors have appeared in recent years. However, man...
Alan Demlow
ICDE
2004
IEEE
87views Database» more  ICDE 2004»
16 years 8 months ago
On Local Pruning of Association Rules Using Directed Hypergraphs
In this paper we propose an adaptive local pruning method for association rules. Our method exploits the exact mapping between a certain class of association rules, namely those w...
Sanjay Chawla, Joseph G. Davis, Gaurav Pandey
ICIP
2009
IEEE
16 years 7 months ago
Fractional Laplacian Pyramids
We provide an extension of the L2-spline pyramid (Unser et al., 1993) using polyharmonic splines. We analytically prove that the corresponding error pyramid behaves exactly as a m...