نتایج جستجو برای: co farthest map
تعداد نتایج: 522648 فیلتر نتایج به سال:
Optical Multi-Trees with Shuffle Exchange (OMTSE) architecture is an efficient model of an optoelectronic computer. The network has a total of 3n/2 nodes. The diameter and bisection width of the network are 6 logn − 1 and n/4 respectively. In this note, we present synchronous SIMD algorithms on an OMTSE optoelectronic computer for the following problems in computational geometry: Convex Hull, S...
Can one walk to infinity on Gaussian primes taking steps of bounded length?” We adopted computational techniques to probe into this open problem. We propose an efficient method to search for the farthest point reachable from the origin, which can be parallelized easily, and have confirmed the existence of a moat of width k = √ 36, whereas the best previous result was k = √ 26 due to Gethner et ...
The mean distance between the apices of the maxillary posterior teeth and the floor of the maxillary sinus was measured from computed tomographic display data from 12 autopsy specimens and 38 human subjects. The distance from these apices to the adjacent lateral bony surfaces was also measured. The apex of the mesiobuccal root of the maxillary second molar was closest to the sinus floor (mean 1...
The large errors in the locations of gamma-ray bursts observed by the Bursts and Transient Source Experiment (BATSE) forces one to adopt statistical comparisons of the burst catalog to models of burst isotropy to determine if bursts are repeating or clustered. In the rst BATSE catalog 1 , a nearest neighbor analysis nds a deviation from isotropy. 2 In a recent article 3 It was shown that known ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید