Sciweavers

3244 search results - page 58 / 649
» On convex complexity measures
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 1 months ago
A strong direct product theorem for two-way public coin communication complexity
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
Rahul Jain
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
ORL
2007
83views more  ORL 2007»
15 years 6 months ago
Large deviations bounds for estimating conditional value-at-risk
In this paper, we prove an exponential rate of convergence result for a common estimator of conditional value-at-risk for bounded random variables. The bound on optimistic deviati...
David B. Brown
CVPR
2012
IEEE
13 years 9 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
TCS
2008
15 years 6 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer