Sciweavers

8689 search results - page 12 / 1738
» Software: hard data
Sort
View
ECCC
2010
78views more  ECCC 2010»
13 years 8 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
OOPSLA
2004
Springer
14 years 1 months ago
RUBiS revisited: why J2EE benchmarking is hard
We have replicated the experiments of Cecchet et al. detailed in ”Performance and Scalability of EJB Applications” at OOPSLA ’02. We report on our experiences configuring, ...
William Pugh, Jaime Spacco
FOSSACS
2001
Springer
14 years 1 months ago
Model Checking CTL+ and FCTL is Hard
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
François Laroussinie, Nicolas Markey, Ph. S...
SEKE
2004
Springer
14 years 1 months ago
Case Study Methodology Designed Research in Software Engineering Methodology Validation
One of the challenging research problems in validating a software engineering methodology (SEM), and a part of its validation process, is to answer “How to fairly collect, presen...
Seok Won Lee, David C. Rine