Sciweavers

58 search results - page 3 / 12
» Characterizing Linear Size Circuits in Terms of Privacy
Sort
View
JCSS
2008
96views more  JCSS 2008»
13 years 5 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
FOCS
2010
IEEE
13 years 3 months ago
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
Moritz Hardt, Guy N. Rothblum
JSC
2010
70views more  JSC 2010»
13 years 16 days ago
Liouvillian solutions of linear difference-differential equations
For a field k with an automorphism and a derivation , we introduce the notion of liouvillian solutions of linear difference-differential systems {(Y ) = AY, (Y ) = BY } over k an...
Ruyong Feng, Michael F. Singer, Min Wu
VLSID
2004
IEEE
146views VLSI» more  VLSID 2004»
14 years 6 months ago
CMOS Circuit Design for Minimum Dynamic Power and Highest Speed
{A new low-power design method produces CMOS circuits that consume the least dynamic power at the highest speed permitted under the technology constraint. A gate is characterized b...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
IMC
2006
ACM
13 years 11 months ago
Generating a privacy footprint on the internet
As a follow up to characterizing traffic deemed as unwanted by Web clients such as advertisements, we examine how information related to individual users is aggregated as a result...
Balachander Krishnamurthy, Craig E. Wills