نتایج جستجو برای: sandiness parameter

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

2007
T Kasar

We propose a novel method for binarization of color documents whereby the foreground text is output as black and the background as white regardless of the polarity of foreground-background shades. The method employs an edge-based connected component approach and automatically determines a threshold for each component. It has several advantages over existing binarization methods. Firstly, it can...

2004
Maria Halkidi Michalis Vazirgiannis

Although the goal of clustering is intuitively compelling and its notion arises in many fields, it has been difficult to define a unified approach to address the clustering problem and thus diverse clustering approaches abound in the research community. These approaches are based on different clustering principles and assumptions and they often lead to qualitatively different results. As a cons...

2008
Martin Dietzfelbinger Jonathan E. Rowe Ingo Wegener Philipp Woelfel

We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution μ over {1, . . . , n}. Initially, the token is placed in a random position in A. In round t, a random value d is chosen according to μ. If the token is in position a ≥ d, then it is moved to position a − d. Otherwise it stays put. Let T be the number of rounds until th...

Journal: :Environmental Health Perspectives 1995
Natalia L. Komarova Dominik Wodarz

Suppose that cells divide with rate l, die with rate d, become quiescent with rate α, and “wake up” from quiescence with rate β. We will refer to parameters α and β as quiescence parameters. Note that the “amount of quiescence” in the colony correlates positively with α and negatively with β. Let us denote by i the number of cycling cells and by j the number of quiescent cells. The system’s sta...

Journal: :International journal of data mining and bioinformatics 2006
Henry C. M. Leung Francis Y. L. Chin

Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif's length is not an input parameter. Unfortunately, their algorithm takes an unacceptably long time to run, e.g. over 3 months to discover a length-14 motif. Since the best motif may not be the longest nor have the largest num...

1998

Due to the uncertainties and variabilities surrounding input measurements, estimates of carcinogenic risk using linear low dose extrapolation should be presented in a manner that reflects the precision of the estimated risk. The precision of the risk estimate can be no better than that for the least certain input parameter into the model. Presentation of additional significant figures in risk e...

Journal: :IACR Cryptology ePrint Archive 2015
Prabhanjan Vijendra Ananth Abhishek Jain Amit Sahai

Present constructions of indistinguishability obfuscation (iO) create obfuscated programs where the size of the obfuscated program is at least a factor of a security parameter larger than the size of the original program. In this work, we construct the first iO scheme that achieves only a constant multiplicative overhead (in fact, the constant is 2) in the size of the program. The security of o...

2016
Hee-Kyung Kim Sung-Hun Kim Jai-Bong Lee Jung-Suk Han In-Sung Yeo Seung-Ryong Ha

PURPOSE This study investigated the effect of amount of thickness reduction on color and translucency of dental monolithic zirconia ceramics. MATERIALS AND METHODS One-hundred sixty-five monolithic zirconia specimens (16.3 mm × 16.3 mm × 2.0 mm) were divided into 5 groups (Group I to V) according to the number of A2-coloring liquid applications. Each group was then divided into 11 subgroups b...

1999
K. H. Hu Jenny Chen C. H. Kuo K. T. Hsu T. S. Ueng

Log-ratio processor working at 500MHz applied to turn-by-turn beam position measurement was implemented. The processor circuit consists of two logarithmic amplifiers and a subtraction circuit. The output value is proportional to beam position. Before, the upper usable frequency of logarithmic amplify is lower than 500MHz. At present, several manufacturers support higher upper usable frequency o...

2013
Matthias Büchse Alexander Koller Heiko Vogler

Binarization of grammars is crucial for improving the complexity and performance of parsing and translation. We present a versatile binarization algorithm that can be tailored to a number of grammar formalisms by simply varying a formal parameter. We apply our algorithm to binarizing tree-to-string transducers used in syntax-based machine translation.

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

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