872 search results - page 14 / 175 » Extreme lower probabilities |
164
Voted
COMGEO
2008
ACM
15 years 3 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
112
Voted
ALT
2008
Springer
16 years 18 days ago
2008
Springer
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
133
click to vote
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
125
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
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...
130
Voted
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...