When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Constant false alarm rate - Wikipedia

    en.wikipedia.org/wiki/Constant_false_alarm_rate

    However, in most fielded systems, unwanted clutter and interference sources mean that the noise level changes both spatially and temporally. In this case, a changing threshold can be used, where the threshold level is raised and lowered to maintain a constant probability of false alarm. This is known as constant false alarm rate (CFAR) detection.

  3. Detection error tradeoff - Wikipedia

    en.wikipedia.org/wiki/Detection_error_tradeoff

    The normal deviate mapping (or normal quantile function, or inverse normal cumulative distribution) is given by the probit function, so that the horizontal axis is x = probit(P fa) and the vertical is y = probit(P fr), where P fa and P fr are the false-accept and false-reject rates.

  4. Root-finding algorithm - Wikipedia

    en.wikipedia.org/wiki/Root-finding_algorithm

    The false position method, also called the regula falsi method, is similar to the bisection method, but instead of using bisection search's middle of the interval it uses the x-intercept of the line that connects the plotted function values at the endpoints of the interval, that is

  5. Matched filter - Wikipedia

    en.wikipedia.org/wiki/Matched_filter

    where [] is the input as a function of the independent variable , and [] is the filtered output. Though we most often express filters as the impulse response of convolution systems, as above (see LTI system theory ), it is easiest to think of the matched filter in the context of the inner product , which we will see shortly.

  6. False discovery rate - Wikipedia

    en.wikipedia.org/wiki/False_discovery_rate

    In statistics, the false discovery rate (FDR) is a method of conceptualizing the rate of type I errors in null hypothesis testing when conducting multiple comparisons. FDR-controlling procedures are designed to control the FDR, which is the expected proportion of "discoveries" (rejected null hypotheses ) that are false (incorrect rejections of ...

  7. Bloom filter - Wikipedia

    en.wikipedia.org/wiki/Bloom_filter

    As a result, the false positive rate for duplicate detection is the same as the false positive rate of the used bloom filter. The process of filtering out the most 'unique' elements can also be repeated multiple times by changing the hash function in each filtering step.

  8. Majority function - Wikipedia

    en.wikipedia.org/wiki/Majority_function

    In Boolean logic, the majority function (also called the median operator) is the Boolean function that evaluates to false when half or more arguments are false and true otherwise, i.e. the value of the function equals the value of the majority of the inputs.

  9. Regula falsi - Wikipedia

    en.wikipedia.org/wiki/Regula_falsi

    The method of false position provides an exact solution for linear functions, but more direct algebraic techniques have supplanted its use for these functions. However, in numerical analysis , double false position became a root-finding algorithm used in iterative numerical approximation techniques.