Sciweavers

811 search results - page 49 / 163
» When Novelty Is Not Enough
Sort
View
ICFP
2010
ACM
13 years 9 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
IWPC
2006
IEEE
14 years 2 months ago
Building Usage Contexts During Program Comprehension
Software developers often work on multiple simultaneous projects. Even when only a single project is underway, everyday distractions interrupt the development effort. Consequently...
Chris Parnin, Carsten Görg
AMAST
2006
Springer
14 years 14 days ago
State Space Representation for Verification of Open Systems
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
Irem Aktug, Dilian Gurov
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 10 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
CIMCA
2006
IEEE
13 years 10 months ago
Identification of Document Language is Not yet a Completely Solved Problem
Existing Language Identification (LID) approaches do reach 100% precision, in most common situations, when dealing with documents written in just one language, and when those docu...
Joaquim Ferreira da Silva, Gabriel Pereira Lopes