Counting addressing method: False triggering problem
نویسندگان
چکیده
منابع مشابه
Addressing false discoveries in network inference
MOTIVATION Experimentally determined gene regulatory networks can be enriched by computational inference from high-throughput expression profiles. However, the prediction of regulatory interactions is severely impaired by indirect and spurious effects, particularly for eukaryotes. Recently, published methods report improved predictions by exploiting the a priori known targets of a regulator (it...
متن کاملApproximation and randomized method for Visibility Counting Problem
For a set of n disjoint line segments S in R, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from a query point p can be computed quickly. This problem can be solved in logarithmic query time using O(n) preprocessing time and space. In this paper, we propose a randomized approximation algorithm for this problem. The space of our algorithm ...
متن کاملStatistical method for resolving the photon-photoelectron-counting inversion problem
A statistical inversion method is proposed for the photon–photoelectron-counting statistics in quantum key distribution experiment. With the statistical viewpoint, this problem is equivalent to the parameter estimation for an infinite binomial mixture model. The coarse-graining idea and Bayesian methods are applied to deal with this ill-posed problem, which is a good simple example to show the ...
متن کاملAddressing the Data Recency Problem
Recommender systems are being widely applied in many E-commerce sites to suggest products, services, and information items to potential users. Collaborative filtering systems, the most successful recommender system technology to date, help people make choices based on the opinions of other people. While collaborative filtering systems have been a substantial success, there are several problems ...
متن کاملAnalyzing and addressing false interactions during compiler optimization phase ordering
Compiler optimization phase ordering is a fundamental, pervasive and longstanding problem for optimizing compilers. This problem is caused by interacting optimization phases producing different codes when applied in different orders. Producing the best phase ordering code is very important in performance-oriented and cost-constrained domains, such as embedded systems. In this work we analyze th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta universitatis - series: Electronics and Energetics
سال: 2009
ISSN: 0353-3670,2217-5997
DOI: 10.2298/fuee0901035r