Sciweavers

4335 search results - page 708 / 867
» Privatizing Constraint Optimization
Sort
View
219
Voted
WWW
2008
ACM
16 years 7 months ago
First workshop on targeting and ranking for online advertising
Online advertising is a rapidly growing, multi-billion dollar industry. It has become a significant element of the Web browsing experience. Ad platforms used for ad selection use ...
Ewa Dominowska, Vanja Josifovski
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
173
Voted
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 7 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
199
Voted
VLSID
2009
IEEE
143views VLSI» more  VLSID 2009»
16 years 7 months ago
SACR: Scheduling-Aware Cache Reconfiguration for Real-Time Embedded Systems
Dynamic reconfiguration techniques are widely used for efficient system optimization. Dynamic cache reconfiguration is a promising approach for reducing energy consumption as well...
Weixun Wang, Prabhat Mishra, Ann Gordon-Ross
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 7 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...