نتایج جستجو برای: point counting method
تعداد نتایج: 2081655 فیلتر نتایج به سال:
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
AIMS To propose a computerised image analysis based method for measuring, on paper mounted lung sections, the area macroscopically occupied by emphysema. METHODS The study was based on the assessment of 69 lung sections prepared following a modified Gough-Wentworth technique. The results obtained from image analysis, point counting, and panel grading methods were compared, as was the repeatab...
abstract although music possesses some kind of power and using it has been welcome by many students in language classrooms, it seems that they take a non-serious image of the lesson while listening to songs and they may think that it is a matter of fun. the main objective of the present study was to investigate whether learning a foreign language through musical texts (songs) can have an impac...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
Memory becomes a limiting factor in contemporary applications, such as analyses of the Webgraph and molecular sequences, when many objects need to be counted simultaneously. Robert Morris [Communications of the ACM, 21:840–842, 1978] proposed a probabilistic technique for approximate counting that is extremely space-efficient. The basic idea is to increment a counter containing the value X with...
A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting still remains very cumbersome and intensively time consuming. In this paper we show that point counting can be avoided at the cost of a protocol slow-down. This slow-down factor is quite important (typically ∼= 500) but proves tha...
Let EΓ be a family of hyperelliptic curves defined by Y 2 = Q(X,Γ), where Q is defined over a small finite field of odd characteristic. Then with γ in an extension degree n field over this small field, we present a deterministic algorithm for computing the zeta function of the curve Eγ by using Dwork deformation in rigid cohomology. The complexity of the algorithm is O(n) and it needs O(n) bits...
We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of 43n for the problem. Moreover, this new bound is useful for bounding the number of other types of planar (i.e., crossing-fre...
Generating function is an effective method to solve combinatorial counting problem, but it most likely to be neglected in combinatorial mathematics teaching. In this paper, we provides a demonstration for combinatorial mathematics teaching improvement by using the generating function solving combination number and the sum of preceding n terms among sequence of numbers.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید