Results 1 - 10
of
1,608
Nested satisfiability
- Acta Informatica
, 1990
"... Abstract. A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way. ..."
Abstract
-
Cited by 16 (0 self)
- Add to MetaCart
Abstract. A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
Flat Zones Filtering, Connected Operators, and Filters by Reconstruction
- IEEE Transactions on Image Processing
, 1995
"... This paper deals with the notion of connected operators. Starting from the definition for operator acting on sets, it is shown how to extend it to operators acting on function. Typically, a connected operator acting on a function is a transformation that enlarges the partition of the space created b ..."
Abstract
-
Cited by 176 (10 self)
- Add to MetaCart
by the fiat zones of the functions. It is shown that, from any connected operator acting on sets, one can construct a connected operator for functions (however, it is not the unique way of generating connected operators for functions). Moreover, the concept of pyramid is introduced in a formal way
The Echo Nest
, 2010
"... “I still maintain that music is the best way of getting the self-expression job done.” ..."
Abstract
- Add to MetaCart
“I still maintain that music is the best way of getting the self-expression job done.”
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
- In Proceedings of the 2000 ACM International Conference on Supercomputing
, 2000
"... We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop ..."
Abstract
-
Cited by 64 (3 self)
- Add to MetaCart
nest, so embedding generalizes techniques like code sinking and loop fusion that are used in ad hoc ways in current compilers to produce perfectly-nested loops from imperfectly-nested ones. In contrast to these ad hoc techniques however, our embeddings are chosen carefully to enhance locality
Generalised Folds for Nested Datatypes
- Formal Aspects of Computing
, 1999
"... Nested datatypes generalise regular datatypes in much the same way that context-free languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, the fold functions are more limited because they can only describe natural transform ..."
Abstract
-
Cited by 43 (1 self)
- Add to MetaCart
Nested datatypes generalise regular datatypes in much the same way that context-free languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, the fold functions are more limited because they can only describe natural
Experience with Processes and Monitors in Mesa
, 1980
"... The use of monitors for describing concurrency has been much discussed in the literature. When monitors are used in real systems of any size, however, a number of problems arise which have not been adequately dealt with: the semantics of nested monitor calls; the various ways of defining the meaning ..."
Abstract
-
Cited by 171 (3 self)
- Add to MetaCart
The use of monitors for describing concurrency has been much discussed in the literature. When monitors are used in real systems of any size, however, a number of problems arise which have not been adequately dealt with: the semantics of nested monitor calls; the various ways of defining
Metacognition the Mathematical Way: Trying to Nest Constructs
"... Abstract Nesting of computational constructs is prevalent in computers. If one had a rigorous and general formal model of cognition, a high-level programmable and computable schema, then it would be possible to provide a cognitive AI system with that schema, let the system apply the schema to its o ..."
Abstract
- Add to MetaCart
Abstract Nesting of computational constructs is prevalent in computers. If one had a rigorous and general formal model of cognition, a high-level programmable and computable schema, then it would be possible to provide a cognitive AI system with that schema, let the system apply the schema to its
Metacognition the Mathematical Way: Trying to Nest Constructs
"... www.actcom.co.il/typographics/zippie Nesting of computational constructs is prevalent in computers. If one had a rigorous and general formal model of cognition, a high-level programmable and computable schema, then it would be possible to pro-vide a cognitive AI system with that schema, let the sys- ..."
Abstract
- Add to MetaCart
www.actcom.co.il/typographics/zippie Nesting of computational constructs is prevalent in computers. If one had a rigorous and general formal model of cognition, a high-level programmable and computable schema, then it would be possible to pro-vide a cognitive AI system with that schema, let the sys
Social exchange in organizations: Perceived organizational support, leader-member exchange, and employee reciprocity
- Journal of Applied Psychology
, 1996
"... have been used to explain the relationship of perceived organizational support and leader-member exchange with employee attitudes and behavior. Recent empirical re-search suggests that individuals engage in different reciprocation efforts depending on the exchange partner (e.g., B. L. McNeely & ..."
Abstract
-
Cited by 178 (2 self)
- Add to MetaCart
; B. M. Meglino, 1994). The purpose of the present study was to further investigate these relationships by examining the relative contribution of indicators of employee-organization exchange and subordinate-supervi-sor exchange. Structural equation modeling was used to compare nested models. Results
A Normal Form for XML Documents
"... This paper takes a rst step towards the design and normalization theory for XML documents. We show that, like relational databases, XML documents may contain redundant information, and may be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among p ..."
Abstract
-
Cited by 167 (8 self)
- Add to MetaCart
paths in the document. Our goal is to nd a way of converting an arbitrary DTD into a well-designed one, that avoids these problems. We rst introduce the concept of a functional dependency for XML, and de ne its semantics via a relational representation of XML. We then de ne an XML normal form, XNF
Results 1 - 10
of
1,608