Results 1  10
of
126
Parsing by matrix multiplication generalized to Boolean grammars
 Theoretical Computer Science
"... The wellknown parsing algorithm for contextfree grammars due to Valiant (“General contextfree recognition in less than cubic time”, Journal of Computer and System Sciences, 10:2 (1975), 308–314) is analyzed and extended to handle the more general Boolean grammars, which are contextfree grammars ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
free grammars augmented with conjunction and negation operators in the rules. The algorithm reduces construction of a parsing table to computing multiple products of Boolean matrices of various sizes. Its time complexity on an input string of length n is O(BMM(n) log n), where BMM(n) is the number of operations
The Geometry of Negation
 JOURNAL OF APPLIED NONCLASSICAL LOGICS
, 2003
"... We consider two ways of thinking about negation: (i) as a form of complementation (the negation of a proposition p holds exactly in those situations in which p fails), and (ii) as an operation of reversal, or inversion (to deny that p is to say that things are the other way around). These two concep ..."
Abstract
 Add to MetaCart
We consider two ways of thinking about negation: (i) as a form of complementation (the negation of a proposition p holds exactly in those situations in which p fails), and (ii) as an operation of reversal, or inversion (to deny that p is to say that things are the other way around). These two
A HYPERPIPELINING APPROACH FOR HIGHSPEED SINGLEMICRO PIPELINE DESIGN FOR HYBRID MULTIPLIER
"... Powerawareness indicates the scalability of the system energy with changing conditions and quality requirements. Multipliers are essential elements used in DSP applications and computer architectures. Although Boolean multipliers have natural power awareness to the changing of input precision, deep ..."
Abstract
 Add to MetaCart
Powerawareness indicates the scalability of the system energy with changing conditions and quality requirements. Multipliers are essential elements used in DSP applications and computer architectures. Although Boolean multipliers have natural power awareness to the changing of input precision
Volume I: Computer Science and Software Engineering
, 2013
"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matrices and polynomials is fundamental for modern computations in Sc ..."
Abstract
 Add to MetaCart
Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matrices and polynomials is fundamental for modern computations
Using the J Language for NN and GA Experiments !!! DRAFT !!!
"... We introduce the programming language J and show its applicability for experimenting with neural networks and genetic algorithms. We illustrate the use of J with complete programs for perceptron and back propagation learning. 1 Introduction The J language provides an excellent programming environme ..."
Abstract
 Add to MetaCart
's data types, primitive operations, and the glue to combine them give experimenters an expressive power like that of traditional mathematical notation. J's ability to work with aggregate data (strings, vectors, matrices, etc.) encourages J programmers to readily bring that same manner of thinking
Green identity, green living? The role of proenvironmental selfidentity in determining consistency across diverse proenvironmental behaviours
 Journal of Environmental Psychology
, 2010
"... Abstract Policymakers are interested in costeffective and socially acceptable ways of encouraging the public to adopt more environmentallyfriendly lifestyles. One area which UK policymakers are focussing on is 'catalyst behaviour', the notion that taking up a new behaviour (such as re ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
environmental behaviour There have been various attempts to extend the TPB to encompass other potentially relevant determinants of behaviour, and thus improve its predictive power. A promising advance in this respect concerns selfidentity (e.g., Sparks & Shepherd, 1992). This is 7" generally understood to mean
TAL Recognition in O(M(n²)) Time
 In Proceedings of the 33rd Annual Meeting of the Association [or Computational Linguistics (ACL '95
, 1995
"... We propose an O(M (n 2 )) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M (k) is the time needed to multiply two k \Theta k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language proce ..."
Abstract
 Add to MetaCart
We propose an O(M (n 2 )) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M (k) is the time needed to multiply two k \Theta k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
 Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
Results 1  10
of
126