Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,127
Optimal resources allocation to elementary networks
"... A wide range of transport bilevel problems are investigated referring to an elementary network consisting of one Origin Destination (OD) pair, with a given demand, connected by two links. In this context it is shown that these problems, generally non-convex, exhibit several local minima. Most result ..."
Abstract
- Add to MetaCart
A wide range of transport bilevel problems are investigated referring to an elementary network consisting of one Origin Destination (OD) pair, with a given demand, connected by two links. In this context it is shown that these problems, generally non-convex, exhibit several local minima. Most
Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
, 1988
"... A three-layered neural network is described for transforming two-dimensional discrete signals into generalized nonorthogonal 2-D “Gabor” representations for image analysis, segmentation, and compression. These transforms are conjoint spatial/spectral representations [lo], [15], which provide a comp ..."
Abstract
-
Cited by 478 (8 self)
- Add to MetaCart
A three-layered neural network is described for transforming two-dimensional discrete signals into generalized nonorthogonal 2-D “Gabor” representations for image analysis, segmentation, and compression. These transforms are conjoint spatial/spectral representations [lo], [15], which provide a
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract
-
Cited by 280 (11 self)
- Add to MetaCart
constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required
Single Display Groupware: A Model for Co-present Collaboration
, 1999
"... We introduce a model for supporting collaborative work between people that are physically close to each other. We call this model Single Display Groupware (SDG). In this paper, we describe this model, comparing it to more traditional remote collaboration. We describe the requirements that SDG places ..."
Abstract
-
Cited by 238 (15 self)
- Add to MetaCart
places on computer technology, and our understanding of the benefits and costs of SDG systems. Finally, we describe a prototype SDG system that we built and the results of a usability test we ran with 60 elementary school children. Keywords CSCW, Single Display Groupware, children, educational
Development of elementary numerical abilities: A neuronal model
- Journal of Cognitive Neuroscience
, 1993
"... Despite their lack of language, human infants and several animal species possess some elementary abilities for numerical processing. These include the ability to recognize that a given numerosity is being presented visually or auditorily, and, at a later stage of development, the ability to compare ..."
Abstract
-
Cited by 123 (14 self)
- Add to MetaCart
Despite their lack of language, human infants and several animal species possess some elementary abilities for numerical processing. These include the ability to recognize that a given numerosity is being presented visually or auditorily, and, at a later stage of development, the ability to compare
A Deterministic Approach to Throughput Scaling in Wireless Networks
- Transactions on Information Theory
, 2004
"... Abstract—We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other ..."
Abstract
-
Cited by 148 (3 self)
- Add to MetaCart
nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain throughput for a general class of network configurations in a fixed area
Elementary Modules in Games Networks
"... Abstract. In this paper we propose an original modular extension of game theory named games network. The objective of games networks is to provide a theoretical framework which suits to modular dynamics resulting from different local interactions between various agents and which enables us to descri ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
equilibria for each game of the network. However, several games networks can represent the same dynamics. We define the notion of dependence between agents, which allows us to com-pute a games network normal form. This normal form emphasizes the elementary modules which compose the games network.
Elementary Modes in Metabolic Networks
"... Background: Metabolic pathway analysis is a powerful tool to study the metabolic structure of a cellular metabolism that comprises an intricate network for transforming metabolites through enzyme-catalyzed reactions. The approach is based on convex analysis to solve a homogeneous system of linear eq ..."
Abstract
- Add to MetaCart
elementary modes which requires only the stoichiometry matrix. The method has been tested with published metabolic networks that
Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type
, 2000
"... This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in ..."
Abstract
-
Cited by 75 (11 self)
- Add to MetaCart
, in term of graph properties that have to hold, where the graph is a structured network of same elementary constraints. Since this classification is based on the internal structure of the global constraints it is also a strong hint for the pruning algorithms of the global constraints. Keywords Constraint
Affective style and affective disorders: Perspectives from affective neuroscience
- Cognition and Emotion
"... Individual diffe rences in emotional reactivity or affective style can be fruitfully decomposed into more elementary constituents. Several separable features of affe ctive style are identi ® ed such as the threshold for reactivity, the peak amplitude of response, the rise time to peak and the recove ..."
Abstract
-
Cited by 176 (16 self)
- Add to MetaCart
Individual diffe rences in emotional reactivity or affective style can be fruitfully decomposed into more elementary constituents. Several separable features of affe ctive style are identi ® ed such as the threshold for reactivity, the peak amplitude of response, the rise time to peak
Results 1 - 10
of
1,127
