Sciweavers

5499 search results - page 889 / 1100
» Generalized Rewrite Theories
Sort
View
ATAL
2011
Springer
14 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
CORR
2012
Springer
218views Education» more  CORR 2012»
14 years 2 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 9 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
CVPR
2007
IEEE
16 years 9 months ago
Trace Ratio vs. Ratio Trace for Dimensionality Reduction
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...
Huan Wang, Shuicheng Yan, Dong Xu, Xiaoou Tang, Th...
GIS
2007
ACM
16 years 8 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar