Sciweavers

393 search results - page 15 / 79
» The LCA Problem Revisited
Sort
View
107
Voted
ICDT
2005
ACM
125views Database» more  ICDT 2005»
15 years 7 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu
144
Voted
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
13 years 9 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 7 months ago
ATNoSFERES revisited
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
Samuel Landau, Olivier Sigaud, Marc Schoenauer
ICTAC
2005
Springer
15 years 7 months ago
Revisiting Failure Detection and Consensus in Omission Failure Environments
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
ICICS
2004
Springer
15 years 7 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa