Sciweavers

2477 search results - page 419 / 496
» Approximate extended formulations
Sort
View
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
12 years 9 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
PODS
2012
ACM
276views Database» more  PODS 2012»
12 years 14 days ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
JMLR
2012
12 years 14 days ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
CVPR
2012
IEEE
12 years 13 days ago
Image categorization using Fisher kernels of non-iid image models
The bag-of-words (BoW) model treats images as an unordered set of local regions and represents them by visual word histograms. Implicitly, regions are assumed to be identically an...
Ramazan Gokberk Cinbis, Jakob J. Verbeek, Cordelia...
EUROCRYPT
2012
Springer
12 years 12 days ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
Jean-Sébastien Coron, David Naccache, Mehdi...