Sciweavers

7971 search results - page 150 / 1595
» On unbounded operators and applications
Sort
View
ENTCS
2007
119views more  ENTCS 2007»
15 years 6 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva
IPPS
2010
IEEE
15 years 4 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
ICINCO
2009
132views Robotics» more  ICINCO 2009»
15 years 4 months ago
Discrete Event Diagnosis using Petri Nets
This paper serves as a support for the plenary address given by the second author during the conference. In this paper we present an approach to on-line diagnosis of discrete even...
Maria Paola Cabasino, Alessandro Giua, Carla Seatz...
TDSC
2011
15 years 1 months ago
CASTLE: Continuously Anonymizing Data Streams
— Most of existing privacy preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are cont...
Jianneng Cao, Barbara Carminati, Elena Ferrari, Ki...
IACR
2011
84views more  IACR 2011»
14 years 6 months ago
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
Allison B. Lewko