نتایج جستجو برای: after preprocessing

تعداد نتایج: 1675770  

Journal: :Briefings in Bioinformatics 2015

Journal: :EURASIP Journal on Advances in Signal Processing 2004

2015
Asa GHOLIZADEH Luboš BORŮVKA Mohammad Mehdi SABERIOON Josef KOZÁK Radim VAŠÁT Karel NĚMEČEK

Gholizadeh A., Borůvka L., Saberioon M.M., Kozák J., Vašát R., Němeček K. (2015): Comparing different data preprocessing methods for monitoring soil heavy metals based on soil spectral features. Soil & Water Res., 10: 218–227. The lands near mining industries in the Czech Republic are subjected to soil pollution with heavy metals. Excessive heavy metal concentrations in soils not only dramatica...

Journal: :CoRR 2013
Anton Belov António Morgado Joao Marques-Silva

State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. Additionally, satisfiability-preserving clause elimination procedures are often used. Since MaxSAT computation typicall...

Journal: :Discrete Applied Mathematics 2007
Alan P. Sprague

We present an algorithm for the all pairs shortest distance problem on permutation graphs. Given a permutation model for the graph on n vertices, after O(n) preprocessing the algorithm will deliver answers to distance queries in O(1) time. In the EREW PRAM model, preprocessing can be accomplished in O(log n) time with O(n) work. Where the distance between query vertices is k, a path can be deli...

2006
M. PADMANABAN

Handwritten Character Recognition is an important part of Pattern Recognition. This is also referred to as Intelligent Character Recognition (ICR). In this paper, a conditional probability based combination of multiple recognizers for character recognition will be introduced. After preprocessing the given character image, different feature recognition algorithms are employed, and their performa...

2010
Hoda Akbari Mohammad Ghodsi

We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n) and after preprocessing, visibility change events for weak and strong visibility can be handled in O(log |VP|) and O(log(|VP1| + |VP2|)) respectively, or O(log n) in which |VP| is the size of the line segment’s ...

2007
Daniel E. Ho Kosuke Imai Gary King Elizabeth A. Stuart

MatchIt implements the suggestions of Ho, Imai, King, and Stuart (2007) for improving parametric statistical models by preprocessing data with nonparametric matching methods. MatchIt implements a wide range of sophisticated matching methods, making it possible to greatly reduce the dependence of causal inferences on hard-to-justify, but commonly made, statistical modeling assumptions. The softw...

2013
Setiawan Hadi

Image preprocessing algorithms for improving the performance of breast cancer detection algorithm have been evaluated and their performance are reported in this paper. Those algorithms are implemented successfully in different sequence combination, those are (i) intensity adjustment before removal of curvilinear structure and (ii) intensity adjustment after removal of curvilinear structure. Int...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید