Sciweavers

198 search results - page 1 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 8 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane
UAI
2004
13 years 6 months ago
Evidence-invariant Sensitivity Bounds
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is perfor...
Silja Renooij, Linda C. van der Gaag
EDBT
2006
ACM
145views Database» more  EDBT 2006»
14 years 5 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
WEBI
2007
Springer
13 years 11 months ago
Experimental Bounds on the Usefulness of Personalized and Topic-Sensitive PageRank
PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web’s link structure. PageRank...
Sinan Al-Saffar, Gregory L. Heileman
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 2 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...