نتایج جستجو برای: e sefr darajeh tv series
تعداد نتایج: 1359688 فیلتر نتایج به سال:
Total variation denoising (TVD) is an approach for noise reduction developed so as to preserve sharp edges in the underlying signal. Unlike a conventional low-pass lter, TV denoising is de ned in terms of an optimization problem. This module describes an algorithm for TV denoising derived using the majorization-minimization (MM) approach, developed by Figueiredo et al. [ICIP 2006]. To keep it s...
The inverse problem involving the determination of a three-dimensional biological structure from images obtained by means of optical-sectioning microscopy is ill-posed. Regularization methods must often be used in order to obtain a reasonable solution. Recently, the Total Variation (TV) regularization, as proposed b y Rudin, Osher and Fatemi [ll], has become very popular for this purpose. A n i...
BACKGROUND The evidence and method are limited for the associations between mortality and temperature variability (TV) within or between days. OBJECTIVES We developed a novel method to calculate TV and investigated TV-mortality associations using a large multicountry data set. METHODS We collected daily data for temperature and mortality from 372 locations in 12 countries/regions (Australia...
تحقیقات اخیر در زمینه منظور شناسی بین زبانی به این نتیجه رسیده اند که بعضی از جنبه های منظور شناسی زبان را می توان در محیط های کلاسی آموزش داد. اما اینکه چه روشهایی و چه مفاد آموزشی بهترین تاثیر را دارند قابل بحث است. بنابراین، هدف از تحقیق حاضر بررسی تاثیر مطالب خودآگاهی بخش برگرفته از ویدئو بر درک کنش های گفتاری عذرخواهی، درخواست و امتناع و صنعت تلویح می باشد. بدین منظور، 78 فارسی زبان سطح مت...
We analyze three different scenarios for security in TV series “24” and compare these scenarios with respect to physical security. We apply “security engineering” to analyze these scenarios and find that these scenes are farfetched from reality.
A graph G = (V,E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of the real line Iv and a positive real number tv in such a way that (uv) ∈ E if and only if |Iv ∩ Iu| ≥ min(tv, tu). No algorithm for recognizing tolerance graphs in general is known. In this paper we present an O(n+m) algorithm for recognizing tolerance graphs that are also bipartite, where n and m ...
Let a network have several sources and sinks. For any flow ƒ let a' and T* denote the vectors of net flows out of the sources and into the sinks, respectively, arranged in order of increasing magnitude. Our algorithm computes an ƒ for which both o> and T' are lexicographic maxima. For a network with n nodes this algorithm terminates within 0(n) operations. 1. The problem. A network (TV, c) cons...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید