نتایج جستجو برای: point counting method
تعداد نتایج: 2081655 فیلتر نتایج به سال:
Cell-based microfluidic devices have attracted interest for a wide range of applications. While optical cell counting and flow cytometry-type devices have been reported extensively, sensitive and efficient non-optical methods to detect and quantify cells attached over large surface areas within microdevices are generally lacking. We describe an electrical method for counting cells based on the ...
The counting losses introduced by the dead time of a counting system are a limiting factor in counting measurements. The purpose of this work is to report an efficient method for the measurement of the effective dead time of a counting system and to characterize its dead time behavior, providing a way to investigate each experimental situation. The method, which we designate as Delayed and Mixe...
We propose an algorithm to compute the Frobenius polynomial of an ordinary non hyperelliptic curve of genus 3 over F2N . The method is a generalization of Mestre’s AGM-algorithm for hyperelliptic curves and leads to a quasi quadratic time algorithm for point counting. The current methods for point counting on curves over finite fields of small characteristic rely essentially on a p-adic approac...
A method of determining the volume of emphysema in excised lungs is presented, with its validation. This method is based on macroscopic point counting using a perforated grid but only the holes (points) overlying emphysema need be counted to produce results within a percentage standard error of 5%. Application of the method shows that an adequate assessment of emphysema cannot be made from one ...
We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field Fq of large characteristic from Õ(log q) to Õ(log q). Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applica...
Cook and Reckhow proved in 1979 that the propositional pigeonhole principle has polynomial size extended Frege proofs. Buss proved in 1987 that it also has polynomial size Frege proofs; these Frege proofs used a completely different proof method based on counting. This paper shows that the original Cook and Reckhow extended Frege proofs can be formulated as quasipolynomial size Frege proofs. Th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید