Filters








47,730 Hits in 6.6 sec

Page 5273 of Mathematical Reviews Vol. , Issue 86k [page]

1986 Mathematical Reviews  
On the basis of the concept of complexity A(x) of the finite configurations introduced here, Alad’ev presents solutions of a number of problems in the theory of L(r,,)-languages generated by the one-dimensional  ...  It should be noted that the solution of these open problems can be found in later work by Alad’ev (“Solutions of a number of problems of the theory of homogeneous structures” (Russian), TR-040684, P/A  ... 

Page 1158 of Mathematical Reviews Vol. , Issue 80C [page]

1980 Mathematical Reviews  
This procedure is also generalized to apply to the more complex classes of cellular arrays. An illustra- tive example of each is included.”  ...  The authors answer an open question concerning the bottom-up pyramid acceptors of C. R. Dyer and A. Rosenfeld (‘Cellular pyramids for image analysis”, Tech. Rep. No. 544, Comp. Sc. Center, Univ.  ... 

Page 1744 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
95c:68078 68Q10 68Q25 68Q80 Ibarra, Oscar H. (1-UCSB-C; Santa Barbara, CA); Jiang, Tao [Jiang, Tao'} (3-MMAS-C; Hamilton, ON) On some open problems concerning the complexity of cellular arrays.  ...  Summary: “We give a brief account of the progress that has been made in the last few years concerning the computational complex- ity of cellular arrays, and cite a few important open problems that remain  ... 

Page 6036 of Mathematical Reviews Vol. , Issue 88k [page]

1988 Mathematical Reviews  
This result, when combined with known results concerning OIAs, answers some open questions concerning the computational complexity of OCAs.  ...  Summary: “There are two simple models of parallel language rec- ognizers: a one-way cellular array (OCA) and a one-way iterative array (OIA).  ... 

Iterative arrays with self-verifying communication cell

Martin Kutrib
2020 Natural Computing  
We study the computational capacity of self-verifying iterative arrays ($${\text {SVIA}}$$ SVIA ).  ...  It turns out that, for any time-computable time complexity, the family of languages accepted by $${\text {SVIA}}$$ SVIA s is a characterization of the so-called complementation kernel of nondeterministic  ...  He participated in the discussions and his ideas were significant contributions to this paper. We consider him truly a co-author, but he insisted not to put his name on the author list.  ... 
doi:10.1007/s11047-020-09812-4 fatcat:prms43tpzrgibpnymb4jhsqtyi

Page 4656 of Mathematical Reviews Vol. , Issue 89H [page]

1989 Mathematical Reviews  
Summary: “There are many fundamental open problems concern- ing cellular arrays (CAs). For example: (1) Is the class of real-time CA languages closed under reversal (concatenation)?  ...  In this paper, we investigate the relationships among these problems as well as prove some posi- tive results concerning CAs.  ... 

Local congruence of chain complexes [article]

Gianmaria DelMonte, Elia Onofri, Giorgio Scorzelli, Alberto Paoluzzi
2020 arXiv   pre-print
While computing the space arrangement generated by a collection of cellular complexes, one may start from independently and efficiently computing the intersection of each single input 2-cell with the others  ...  The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies  ...  An important problem in computational geometry is to asses the arrangement [4, 6] of Euclidean 3space, i.e., the partition of E 3 produced by a collection of cellular 3-complexes.  ... 
arXiv:2004.00046v1 fatcat:ie57rku3jrfpnacjkkfistfdxa

A Machine-Independent Theory of the Complexity of Recursive Functions

Manuel Blum
1967 Journal of the ACM  
This paper is little more than a rehash of well-known results, mostly from the paper of Bartee and Schneider (Information and Control, vol. 6, pp. 79-98, 1963) and from Elspas (IRE Trans.  ...  Standard algebraic theorems, notably the Cayley-Hamilton theorem, and well-known results on companion matrices are (unnecessarily) demonstrated when a reference to, e.g., Birkhoff-Mac-Lane would have sufficed  ...  artificial complexity measures, such as the number of tape reversals on a one-tape Turing machine, which lack intuitive appeal but do lead to some amusing results.  ... 
doi:10.1145/321386.321395 fatcat:v4gtbzjpqfak7fqbng25fmpx6i

R69-24 Universal Logic Circuits and Their Modular Realizations

A. Mukhopadhyay
1969 IEEE transactions on computers  
This paper is little more than a rehash of well-known results, mostly from the paper of Bartee and Schneider (Information and Control, vol. 6, pp. 79-98, 1963) and from Elspas (IRE Trans.  ...  Standard algebraic theorems, notably the Cayley-Hamilton theorem, and well-known results on companion matrices are (unnecessarily) demonstrated when a reference to, e.g., Birkhoff-Mac-Lane would have sufficed  ...  artificial complexity measures, such as the number of tape reversals on a one-tape Turing machine, which lack intuitive appeal but do lead to some amusing results.  ... 
doi:10.1109/t-c.1969.222768 fatcat:m5dsuoqucvgrbjzgjjqkpuueem

Receptor uptake arrays for vitamin B12 , siderophores, and glycans shape bacterial communities

Steven A. Frank
2017 Ecology and Evolution  
The design of receptor arrays reflects key processes that shape cellular evolution. Competition may focus each species on a subset of the available nutrient diversity.  ...  Recent advances in deep learning studies of artificial intelligence focus on the architecture of regulatory wiring and the ways in which complex control networks represent and classify environmental states  ...  complexes, and the competition for cellular uptake of those complexes.  ... 
doi:10.1002/ece3.3544 pmid:29238546 pmcid:PMC5723603 fatcat:3z5jqhsknrdhtljwrro34kpouq

Reflections on industrial research [leadership reflections

J.H. Winters
2005 IEEE Signal Processing Magazine  
As an example, my dissertation was on adaptive arrays for military systems, where cost and complexity were not of great concern but the interferer tried to do the greatest harm.  ...  For example, one effective method is to bring a number of researchers together for a seminar and then see if some of the researchers discern a piece of the overall problem that they can handle.  ... 
doi:10.1109/msp.2005.1458266 fatcat:phhtw7y42nbzvkkdeir4lbn3my

Relating the power of cellular arrays to their closure properties

Oscar H. Ibarra, Tao Jiang
1988 Theoretical Computer Science  
There are many fundamental open problems concerning ceMar arrays (CA's). For example: (1) Is the class of real-time CA languages closed under reversal (concatenation)?  ...  Although some of these problems appear to be easier to resolve than the others, e.g., problem (1) seems easier than (2), no solution to any of these pr&lems is forthcoming.  ...  mean the problem is open.  ... 
doi:10.1016/0304-3975(88)90040-0 fatcat:jyjdv2rzpvbzxp7eltiwuxcuvm

Receptor Uptake Arrays For Vitamin B12, Siderophores And Glycans Shape Bacterial Communities [article]

Steven A. Frank
2017 bioRxiv   pre-print
The design of receptor arrays reflects key processes that shape cellular evolution. Competition may focus each species on a subset of the available nutrient diversity.  ...  Recent advances in deep learning studies of artificial intelligence focus on the architecture of regulatory wiring and the ways in which complex control networks represent and classify environmental states  ...  Cellular perception concerns cellular sensors and the use of information to regulate cellular expression and phenotype.  ... 
doi:10.1101/144691 fatcat:kyk2ashuonh5tg6f2xbd7yprmi

Synthesis, structure and power of systolic computations

Jozef Gruska
1990 Theoretical Computer Science  
Ilnpltmentation problems have also led to some interesting theoretical problems. VLSI implementations are not the only way to make use of the advantages of systolic systems.  ...  Systolic systems can be seen as an interesting and useful modification (simplification mostly), of the cellular automata concept of von Neumann, with more emphasis on regularity and transparency of data  ...  The following theorem summarixes recent results that show surprising power of one-way communication and the relation of some of the open problems of this type to other well-known problems (for example,  ... 
doi:10.1016/0304-3975(90)90190-s fatcat:sztlpeed4jhcdojkzi5z5zyska

Simple + parallel + local = cellular computing [chapter]

Moshe Sipper
1998 Lecture Notes in Computer Science  
This paper provides a qualitative exposition of the cellular computing paradigm, including sample applications and a discussion of some of the research issues involved.  ...  addressing much larger problem instances than was possible before|at least for some application domains.  ...  The third and nal distinguishing property of cellular computing concerns the local connectivity pattern between cells.  ... 
doi:10.1007/bfb0056907 fatcat:iyo7zb6j2rcmdk5ljugmamx7ky
« Previous Showing results 1 — 15 out of 47,730 results