Results 1  10
of
13,933
The basic construction
"... In this section we shall assume that all algebras are finite dimensional algebras over an algebraically closed field F. The fact that F is algebraically closed is only for convenience, to avoid the division rings that could arise in the decomposition of Ā just before (4.8) below. Let A ⊆ B be an inc ..."
Abstract
 Add to MetaCart
be an inclusion of algebras. Then B ⊗F B is an (A, A)bimodule where A acts on the left by left multiplication and on the right by right multiplication. Fix an (A, A)bimodule homomorphism ε: B ⊗F B − → A. (1.1) The basic construction is the algebra B ⊗A B with product given by (b1 ⊗ b2)(b3 ⊗ b4) = b1 ⊗ ε(b2 ⊗ b
CELLULARITY AND THE JONES BASIC CONSTRUCTION
, 2009
"... We establish a framework for cellularity of algebras related to the Jones basic construction. Our framework allows a uniform proof of cellularity of Brauer algebras, ordinary and cyclotomic BMW algebras, walled Brauer algebras, partition algebras, and others. Our cellular bases are labeled by path ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We establish a framework for cellularity of algebras related to the Jones basic construction. Our framework allows a uniform proof of cellularity of Brauer algebras, ordinary and cyclotomic BMW algebras, walled Brauer algebras, partition algebras, and others. Our cellular bases are labeled
Quasicategories basic constructions
"... The project consists of two chapters and an appendix. In the rst chapter de ne quasicategories, and perform basic constructions with these, some of which are motivated by ordinary category theory. Among these, we shall build undercategories and colimits. Also we brie y review some di erent notions ..."
Abstract
 Add to MetaCart
The project consists of two chapters and an appendix. In the rst chapter de ne quasicategories, and perform basic constructions with these, some of which are motivated by ordinary category theory. Among these, we shall build undercategories and colimits. Also we brie y review some di erent
Core affect and the psychological construction of emotion
 Psychological Review
"... At the heart of emotion, mood, and any other emotionally charged event are states experienced as simply feeling good or bad, energized or enervated. These states—called core affect—influence reflexes, perception, cognition, and behavior and are influenced by many causes internal and external, but pe ..."
Abstract

Cited by 448 (0 self)
 Add to MetaCart
, but people have no direct access to these causal connections. Core affect can therefore be experienced as freefloating (mood) or can be attributed to some cause (and thereby begin an emotional episode). These basic processes spawn a broad framework that includes perception of the core
A Bayesian method for the induction of probabilistic networks from data
 MACHINE LEARNING
, 1992
"... This paper presents a Bayesian method for constructing probabilistic networks from databases. In particular, we focus on constructing Bayesian belief networks. Potential applications include computerassisted hypothesis testing, automated scientific discovery, and automated construction of probabili ..."
Abstract

Cited by 1400 (31 self)
 Add to MetaCart
of probabilistic expert systems. We extend the basic method to handle missing data and hidden (latent) variables. We show how to perform probabilistic inference by averaging over the inferences of multiple belief networks. Results are presented of a preliminary evaluation of an algorithm for constructing a belief
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 647 (82 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
On µkernel construction
 Symposium on Operating System Principles
, 1995
"... From a softwaretechnology point of view, thekernel concept is superior to large integrated kernels. On the other hand, it is widely believed that (a)kernel based systems are inherently inefficient and (b) they are not sufficiently flexible. Contradictory to this belief, we show and support by doc ..."
Abstract

Cited by 429 (25 self)
 Add to MetaCart
by documentary evidence that inefficiency and inflexibility of currentkernels is not inherited from the basic idea but mostly from overloading the kernel and/or from improper implementation. Based on functional reasons, we describe some concepts which must be implemented by akernel and illustrate
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 546 (0 self)
 Add to MetaCart
time algorithm for obtaining a compacted version of a bitree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4], in linear time.
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 773 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
Results 1  10
of
13,933