R. L. Causey, On Closest Normal Matrices, Ph.D. Thesis, Department of Computer Science, Stanford University, 1964.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in process algebras are given operational semantics by means of simple GSOS rules. An exception is the binary Kleene star, which was discussed in Sect. 5.4.1. Two further exceptions are the desynchronizing Delta operation present in the early versions of Milner s SCCS [156] studied in [116, 155], and the parallel composition operation in the calculus [161] The Delta operation has GSOS rules Deltax ffi Deltax for a 2 Act, where ffi is the delay operation of SCCS. The GSOS rules for the parallel composition operation of the calculus dealing with so called scope extrusion ....

, On relating synchrony and asynchrony, Tech. Rep. CSR--75--80, Department of Computer Science, University of Edinburgh, 1981.

....Twith at leastf (n, t(n) elements exhibits the given lower bound on messages. We achieve this result by giving a transformation from any algorithm in what we call free form, over such a set T, to a comparison based algorithm. The ideas for this transformation are derived from earlier work of Snir [ 14]. Both of our lower bound results hold even in the case that the number of processors in the ring is known to each processor, and all the processors are known to start at the same round. 2. The Algorithm In this section we present an algorithm for electing a leader in a synchronous ring. The ....

....Algorithms In this section we prove our lower bound for time bounded algorithms. We use the lower bound for comparison algorithms to do this. First, we show how to map from time bounded algorithms to comparison algorithms. This result, presented in the paracomputer model, is due to Snir [14], Snir (personal communication) credits Yao [16] with inspiration for this result. For completeness, we present a careful proof in our setting, even though a similar proof appears in [ 14] We then infer the lower bound for time bounded algorithms. 7.1 DEFINITIONS. In order to map from ....

[Article contains additional citation context not shown here]

SNIR, M. On parallel searching. Department of Computer Science, RR 83-21. Hebrew Univ. of Jerusalem, Jerusalem, Israel, June 1983.

.... executedina difierent environmentthanthecallingprogram,andpossibly ina difierent machine.Dataexchangebetweenthecallerand thecalled processesisperformedonlyby parameterand returnvaluepassing.Fora comprehensive explanationoftheRPC concept,thereaderisencouragedto read[1] 6]or[9]. The Sun RPC implementationscheme isbasedintheexistenceofa portmapperprocessineach host.The port mapperisaccessibleata predeflned, well know address(thesameforallsystems)and itspurposeistokeepa map ofallthe remoteaccessibleprograms availableatthelocalmachine. The port mapperitselfisa ....

P.G. Soares,On RemoteProcedure Call,AreaPaper,Department of ComputerScience,ColumbiaUniversity,January1992.

.... reduction to a suitable recursive definition (at least in the setting considered in this paper) is the desynchronizing operation Delta given by the rules (one such rule for each a 2 Act) Delta(x) ffi ( Delta(x ) This operation is present in the early versions of SCCS studied in [61, 38, 79]. As remarked in [79, Page 249] this operation is primitive, i.e. it cannot be expressed in terms of the other operations of SCCS. 8.2 Further Work As suggested by the title of this paper, we plan to direct our research effort to the study of cpo based denotational models for arbitrary GSOS ....

, On relating synchrony and asynchrony, Tech. Rep. CSR--75--80, Department of Computer Science, University of Edinburgh, 1981.

....(1.4) from which we will have our third main result in this paper. This is about the structure of G when G is finite. We begin with an explanation on why we are interested in this problem. Suppose G = fK 1 g. Then the class G is known as the class of cographs [2] which was first introduced in [7] and was also characterized in the same paper as follows. 1.7) A graph is a cograph if and only if it does not contain P 4 as an induced subgraph. Cographs have been rediscovered several times by different researchers, under various names, including dacey graphs [10] D graphs [6] and ....

H. Lerch. On cliques and Kernels. Technical report, Department of Computer Science, University of Toronto, 1971.

....of JAM appeared in [53] Here we describe the nal design and implementation details of this system architecture. 1 The main purpose of this paper is to describe the system architecture of JAM. Additional multiple model experiments with results on other tasks and data sets can be found in [15, 14]. 2 JAM is architected as a distributed computing construct developed on top of OS environments. It can be viewed as a coarse grain parallel application, with each constituent process running on a separate database site. JAM is an agent based system that supports the launching of learning, ....

W. Fan. On the eective use of stacking. PhD thesis, Department of Computer Science, Columbia University, New York, NY, 2000.

No context found.

M. Ogihara. On serializable languages. Technical Report TR-518, University of Rochester, Department of Computer Science, Rochester, NY, June 1994. To appear in International Journal of Foundations of Computer Science.

No context found.

Z. Drmac. On principal angles between subspaces of Euclidean space, March 1997. Department of Computer Science, University of Colorado at Boulder, Technical report CU-CS-838-97. SIAM J. Matrix Anal. Appl., pending revision.

No context found.

"A Workshop on the Icon Programming Language", Ralph E. Griswold, Icon Project Document IPD61, Department of Computer Science, The University of Arizona, 1988.

No context found.

C. Gotsman. On boolean functions, polynomials and algebraic threshold functions. Technical Report TR-89-18, Department of Computer Science, Hebrew University, 1989.

No context found.

Nirad Sharma. On Formalizing and Reasoning with Contexts. Technical Report 352, Department of Computer Science, The University of Queensland, September 1995.

No context found.

C. Gotsman, On Boolean functions, polynomials and algebraic threshold functions. Technical report TR-89-18, Department of Computer Science, Hebrew University, 1989.

No context found.

Courseware on the Fly, M.Sc Thesis, Department of Computer Science, Trinity College, Dublin, 1998 [B.J. Dillon]

....in time O(jV j jEj) and O(jV j log k 1 jV j) respectively. On the one hand he showed the NP completeness of this problem on bipartite graphs and permutation graphs, and on the other hand he proved that the OCCP problem can be solved for cobipartite graphs in polynomial time. We have proved in [17] that the greedy algorithm which finds maximal independent sets consecutively can solve the OCCP problem for P 4 reducible graphs (graphs in which each vertex is in at most one P 4 ) which strictly contain cographs. Therefore this result extends the result of Jansen, for cographs. The only ....

....= 6 is NP hard. This is the first complexity result on the strength of graphs. In section 3 some algorithms for various restricted classes of graphs are presented. We show that there is a linear time algorithm for finding an optimum vertex coloring of chain bipartite graphs. The author proves in [17] that the sum coloring problem is NP complete for split graphs. Here we show that if we bound the outgoing degree of each vertex in one of the parts of a split graph, the clique part or the independent set part, then there is a polynomial time algorithm for them. The time complexity of the edge ....

[Article contains additional citation context not shown here]

M. Salavatipour, On sum coloring of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto (2000).

.... In logic, The context of a set of logical sentences (a theory) is defined as being: those assumptions of the environment, typically not feasibly axiomatisable and hence formalized as an abstract object, relative to which the language and the sentences in that language are stated for the theory [103]. For the purposes of this thesis, in the context of information modeling, a context is viewed as a reference environment relatively to which descriptions of real world objects are given. The notion of context may be used to represent real world partitions, divisions, or in general, groups of ....

Nirad Sharma. On Formalizing and Reasoning with Contexts. Technical Report 352, Department of Computer Science, The University of Queensland, September 1995.

No context found.

R. L. Causey, On Closest Normal Matrices, Ph.D. Thesis, Department of Computer Science, Stanford University, 1964.

No context found.

SIGPLAN Workshop on Continuations, Technical report CSR-04-1, Department of Computer Science, Queen Mary's College, pages 13--23, Venice, Italy, January 2004. Invited talk.

No context found.

Minr S., On Structure-Oriented Editing, PhD. Thesis, Department of Computer Science, Lund University, Sweden, 1990

No context found.

M. de Berg and K. T. G. Dobrindt. On levels of detail in terrains. Technical Report UU-CS-1995-12, Department of Computer Science, Utrecht University, 1995.

No context found.

H. Lerchs, On cliques and kernels, Department of Computer Science, University of Toronto, March 1971.

No context found.

H. Lerchs, On Cliques and Kernels, Technical Report, Department of Computer Science, University of Toronto, 1971.

No context found.

H. Lerchs, On cliqus and kernels, Department of Computer Science, University of Toronto, March 1971.

No context found.

H. Lerchs, On cliqus and kernels, Tech. Report, Department of Computer Science, University of Toronto, March 1971.

No context found.

Bikram Sengupta. On the Sematics of Statecharts. Department of Computer Science, State University of New York al.Stony Brook, NY 11794 .

No context found.

H. Lerchs, On cliques and kernels, Department of Computer Science, Universtity of Toronto, March 1971.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC