Sciweavers

3179 search results - page 297 / 636
» Applications of PCF Theory
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 27 days ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
110
Voted
ECCV
2008
Springer
16 years 2 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....
115
Voted
KDD
2009
ACM
133views Data Mining» more  KDD 2009»
16 years 1 months ago
On the tradeoff between privacy and utility in data publishing
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
Tiancheng Li, Ninghui Li
POPL
2005
ACM
16 years 1 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
111
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi