Sciweavers

2354 search results - page 269 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ESORICS
2003
Springer
15 years 11 months ago
Rapid Mixing and Security of Chaum's Visual Electronic Voting
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...
Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kut...
171
Voted
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 8 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
ICML
2009
IEEE
16 years 7 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
149
Voted
ICML
2000
IEEE
16 years 7 months ago
Reinforcement Learning in POMDP's via Direct Gradient Ascent
This paper discusses theoretical and experimental aspects of gradient-based approaches to the direct optimization of policy performance in controlled ??? ?s. We introduce ??? ?, a...
Jonathan Baxter, Peter L. Bartlett
ICC
2009
IEEE
170views Communications» more  ICC 2009»
16 years 27 days ago
Adaptive Coherent Lp-Norm Combining
— In this paper, we introduce an adaptive Lp–norm metric for robust coherent diversity combining in non–Gaussian noise and interference. We derive a general closed–form exp...
Amir Nasri, Ali Nezampour, Robert Schober