Sciweavers

198 search results - page 2 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
JMLR
2010
125views more  JMLR 2010»
13 years 13 days ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra
COMPGEOM
2006
ACM
13 years 11 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
SIAMJO
2002
105views more  SIAMJO 2002»
13 years 5 months ago
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
E. Alper Yildirim, Michael J. Todd
TMI
2010
94views more  TMI 2010»
13 years 4 months ago
Theoretical Bounds and System Design for Multipinhole SPECT
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
Peter Nillius, Mats Danielsson
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
13 years 10 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén