Sciweavers

565 search results - page 72 / 113
» Geometry of Upper Probabilities
Sort
View
NIPS
2003
13 years 11 months ago
Human and Ideal Observers for Detecting Image Curves
This paper compares the ability of human observers to detect target image curves with that of an ideal observer. The target curves are sampled from a generative model which speciï...
Alan L. Yuille, Fang Fang, Paul R. Schrater, Danie...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 10 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 10 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
FOCS
2007
IEEE
14 years 4 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova