Sciweavers

4315 search results - page 840 / 863
» Sorting in linear time
Sort
View
CONCUR
2010
Springer
13 years 8 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
AAAI
2010
13 years 7 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
CCS
2010
ACM
13 years 7 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler