نتایج جستجو برای: cartesian
تعداد نتایج: 9703 فیلتر نتایج به سال:
We pose the problem of whether every FS-domain is a retract of abifinite domain purely in terms of quasi-uniform spaces. 6.1 The problem and its historyEver since domains were introduced by Dana Scott [Sco70] and Yuri Er-shov [Ers75], a question in the centre of interest was to find suitable cartesianclosed categories of domains and the quest for cartesian closed categories ...
Synopsis Iterative reconstructions of undersampled non-Cartesian data are computationally expensive because non-Cartesian Fourier transforms are much less e cient than Cartesian Fast Fourier Transforms. Here, we introduce an algorithm that does not require non-uniform Fourier transforms during optimization iterations, resulting in large reductions in computation times with no impairment of imag...
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید