Sciweavers

4670 search results - page 589 / 934
» Testing that distributions are close
Sort
View
PODS
2008
ACM
174views Database» more  PODS 2008»
16 years 7 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
JAVA
2001
Springer
16 years 1 days ago
A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
Peter R. Cappello, Dimitros Mourloukos
CPHYSICS
2008
123views more  CPHYSICS 2008»
15 years 7 months ago
wannier90: A tool for obtaining maximally-localised Wannier functions
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
Arash A. Mostofi, Jonathan R. Yates, Young-Su Lee,...
CPHYSICS
2007
222views more  CPHYSICS 2007»
15 years 7 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
16 years 8 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...