Sciweavers

6315 search results - page 422 / 1263
» Approximating Solution Structure
Sort
View
162
Voted
IJCAI
2007
15 years 9 months ago
Iterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
Shih-Fen Cheng, Michael P. Wellman
ICML
2010
IEEE
15 years 7 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
197
Voted
CGF
2010
115views more  CGF 2010»
15 years 7 months ago
Closed-form Blending of Local Symmetries
We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of ...
Deboshmita Ghosh, Nina Amenta, Michael M. Kazhdan
CORR
2010
Springer
113views Education» more  CORR 2010»
15 years 7 months ago
Traffic Capacity of Large WDM Passive Optical Networks
As passive optical networks (PON) are increasingly deployed to provide high speed Internet access, it is important to understand their fundamental traffic capacity limits. The pape...
Nelson Antunes, Christine Fricker, Philippe Robert...
220
Voted
ECCC
2010
78views more  ECCC 2010»
15 years 7 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan