bisection


Also found in: Dictionary, Thesaurus, Legal, Encyclopedia, Wikipedia.

bisection

 [bi-sek´shun]
division into two parts by cutting.

bisection

/bi·sec·tion/ (bi-sek´shun) division into two parts by cutting.

bisection

Division of something into two roughly equal parts.

bisection

division into two parts by cutting.
References in periodicals archive ?
Pseudoneglect: a review and meta-analysis of performance factors in line bisection tasks.
The anterior portions of bisected larvae gradually decreased in size after bisection (immediately after bisection = 306 [+ or -] 47 [micro]m in length; 11 days later = 233 [+ or -] 29 [micro]m in length; n = 20 [+ or -] 1 SD).
By the bisection techniques future values of TMP1 will be less than the current value, and we can conclude from (4) that the jump to 91 will never be earlier than J during the search for the kth smallest eigenvalue.
n] produced by the algorithm is at most [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] denotes the optimal bisection width of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for 1 [is less than or equal to] r [is less than or equal to] O(log n).
Low-dimensional meshes also have higher channel bandwidth per bisection density and have lower contention and blocking latencies, which results in lower communication latencies and higher hotspot throughput [Dally 1990].
Spatial neglect in acute stroke: the line bisection test.
Bartlett's bisection theorem also is applied to the structure of two back-to-back baluns, as shown in Figure 4.
No significant differences were found for the other four tests of neglect, however, Line Bisection and Visual Search and Attention results approached statistical significance with the advantage to the without goggles condition.
Having restricted Rahn's question, I now broaden it to include not only bisection, but division of intervals into any fixed number of equivalent parts.
1971]: 'Brain Bisection and the Unity of Consciousness', Synthese, 22, pp.
After discussing address-space requisition from RIRs, DeLong will discuss two methodologies for dividing the address space among end users: "Sequential Allocation" and "Allocation by Bisection.
From Proposition 1, a bisection search algorithm can be employed to solve the KTT conditions (14a)-(14d) on x, which leads to the global optimal solution of the problem (13a)-(13c).