HomeSort by relevance Sort by last modified time
    Searched defs:median (Results 1 - 24 of 24) sorted by null

  /external/chromium_org/net/quic/congestion_control/
channel_estimator.cc 68 size_t median = sorted_bitrate_estimates_.Size() / 2; local
83 if (i == median) {
94 // 25% of the median bitrate we consider the estimate to be uncertain.
  /cts/libs/commonutil/src/com/android/cts/util/
Stat.java 72 * while rejecting outlier +/- median * rejectionThreshold.
79 double median; local
81 median = dataCopied[medianIndex];
83 median = (dataCopied[medianIndex - 1] + dataCopied[medianIndex]) / 2.0;
85 double thresholdMin = median * (1.0 - rejectionThreshold);
86 double thresholdMax = median * (1.0 + rejectionThreshold);
89 double min = median;
90 double max = median;
113 } else { // both median is showing too much diff
114 average = median;
    [all...]
  /external/ceres-solver/examples/
bal_problem.cc 80 double Median(std::vector<double>* data) {
234 // Compute the marginal median of the geometry.
236 Eigen::Vector3d median; local
242 median(i) = Median(&tmp);
247 tmp[i] = (point - median).lpNorm<1>();
250 const double median_absolute_deviation = Median(&tmp);
252 // Scale so that the median absolute deviation of the resulting
256 VLOG(2) << "median: " << median.transpose()
    [all...]
  /external/chromium_org/cc/scheduler/
texture_uploader.cc 112 // Use the median as our estimate.
113 std::multiset<double>::iterator median = textures_per_second_history_.begin(); local
114 std::advance(median, textures_per_second_history_.size() / 2);
115 return *median;
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/vl/
vl_median_filter.c 86 const unsigned median = num_offsets >> 1; local
136 for (i = 0; i <= median; ++i) {
144 if (i == median)
149 ureg_MOV(shader, o_fragment, ureg_src(t_array[median]));
  /external/mesa3d/src/gallium/auxiliary/vl/
vl_median_filter.c 86 const unsigned median = num_offsets >> 1; local
136 for (i = 0; i <= median; ++i) {
144 if (i == median)
149 ureg_MOV(shader, o_fragment, ureg_src(t_array[median]));
  /external/srec/srec/include/
specnorm.h 64 int median; member in struct:__anon26524
  /hardware/invensense/60xx/mlsdk/mllite/
compass.c 107 float avg, sum, median, sorted[YAS_DEFAULT_FILTER_LEN]; local
131 median = sorted[adap_filter->len/2];
140 return median;
  /system/extras/tests/bionic/libc/common/
bench_pthread.c 96 int64_t min, max, avg, median; local
109 /* the median is the center item */
110 median = stats[(min_index+max_index)/2];
126 median*1./SUBCOUNT,
  /external/opencv/cv/src/
_cvkdtree.hpp 113 // given point indices and dimension, find index of median; (almost) modifies [first,last)
114 // such that points_in[first,median]<=point[median], points_in(median,last)>point[median].
164 __instype *median = median_partition(first, last, dim, ctor); local
166 __instype *split = median;
168 deref(ctor(*median), dim); ++split);
189 n.boundary = deref(ctor(*median), dim);
cvfundam.cpp 321 double median = count % 2 != 0 ? local
324 if( median < minMedian )
326 minMedian = median;
    [all...]
  /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/
webrunner.js 115 // For making Median and Variance
173 // Make Median
174 results.median = num % 2 == 0 ?
490 results[curID].total[run] = {max:0, mean:0, median:0, min:0, deviation:0, error:0, num:0};
    [all...]
  /external/webrtc/src/modules/audio_processing/test/
process_test.cc 908 int median = 0; local
910 apm->echo_cancellation()->GetDelayMetrics(&median, &std);
912 printf("Median: %3d\n", median);
    [all...]
unit_test.cc 523 int median = 0; local
526 apm_->echo_cancellation()->GetDelayMetrics(&median, &std));
1166 int median = 0; local
    [all...]
  /external/libvpx/libvpx/vp8/encoder/
encodeframe.c 144 /* Find median: Simple n^2 algorithm for experimentation */
146 unsigned int median; local
178 /* Even number MBs so estimate median as mean of two either side. */
179 median = ( 1 + sortlist[cpi->common.MBs >> 1] +
182 cpi->activity_avg = median;
    [all...]
  /external/blktrace/btt/
output.c 323 long long nseeks, median; member in struct:o_seek_info
354 sip->median / sip->nseeks, new_list->mode, new_list->nseeks);
397 long long median; local
404 median = seeki_median(handle);
409 median, nmodes > 0 ? m.modes[0] : 0, m.most_seeks);
423 nseeks, mean, median,
432 seek_info.median += (nseeks * median);
454 "MEAN", "MEDIAN", "MODE");
460 "Overall", "NSEEKS", "MEAN", "MEDIAN", "MODE")
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_encodeframe.c 172 // Find median: Simple n^2 algorithm for experimentation
174 unsigned int median; local
201 // Even number MBs so estimate median as mean of two either side.
202 median = (1 + sortlist[cpi->common.MBs >> 1] +
205 cpi->activity_avg = median;
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/media/webrtc/
webrtcvoiceengine.cc 2986 int median, std; local
    [all...]
  /prebuilts/devtools/tools/lib/
jfreechart-1.0.9.jar 
ddmuilib.jar 
  /prebuilts/tools/common/jfreechart/
jfreechart-1.0.9.jar 
  /prebuilts/tools/common/m2/repository/jfree/jfreechart/1.0.9/
jfreechart-1.0.9.jar 
  /libcore/benchmarks/libs/
caliper.jar 
  /prebuilts/misc/common/tradefed/
tradefed-prebuilt.jar 

Completed in 608 milliseconds