Results 1  10
of
1,890
Convenient Representations of Structured Systems for Model Order Reduction
"... Abstract—In control theory there exist two convenient representations of a model, which are transfer functions and statespace matrices. However, structure in the transfer functions is not clearly seen in the statespace form, and on the other hand structure in the statespace form is not clearly s ..."
Abstract
 Add to MetaCart
Abstract—In control theory there exist two convenient representations of a model, which are transfer functions and statespace matrices. However, structure in the transfer functions is not clearly seen in the statespace form, and on the other hand structure in the statespace form is not clearly
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1816 (10 self)
 Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
approximating a value function and using that to compute a deterministic policy, we approximate a stochastic policy directly using an independent function approximator with its own parameters. For example, the policy might be represented by a neural network whose input is a representation of the state, whose
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
, 1993
"... We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are highdim ..."
Abstract

Cited by 358 (5 self)
 Add to MetaCart
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are high
Octrees for faster isosurface generation
 IEEE TRANSACTIONS ON MEDICAL IMAGING
, 2000
"... The large size of many volume data sets often prevents visualization algorithms from providing interactive rendering. The use of hierarchical data structures can ameliorate this problem by storing summary information to prevent useless exploration of regions of little or no current interest within ..."
Abstract

Cited by 322 (3 self)
 Add to MetaCart
is introduced for octree representations of volumes whose resolutions are not conveniently a power of two; octrees following this design are called branchonneed octrees (BONOs). Also, a caching method is described that essentially passes information between octree neighbors whose visitation times may be quite
Biped walking pattern generation by using preview control of zeromoment point
 in Proceedings of the IEEE International Conference on Robotics and Automation
, 2003
"... We introduce a new method of a biped walking pattern generation by using a preview control of the zeromoment point (ZMP). First, the dynamics of a biped robot is modeled as a running cart on a table which gives a convenient representation to treat ZMP. After reviewing conventional methods of ZMP bas ..."
Abstract

Cited by 236 (16 self)
 Add to MetaCart
We introduce a new method of a biped walking pattern generation by using a preview control of the zeromoment point (ZMP). First, the dynamics of a biped robot is modeled as a running cart on a table which gives a convenient representation to treat ZMP. After reviewing conventional methods of ZMP
On stress and linguistic rhythm
 Linguistic Inquiry
, 1977
"... In this essay a new theory of stress and linguistic rhythm will be elaborated, based on the proposals of Liberman (1975). ' It will be argued that certain features of prosodic systems like that of English, in particular the phenomenon of "stress subordination", are not to be referred ..."
Abstract

Cited by 213 (7 self)
 Add to MetaCart
apprehended in terms of the phonological cycle, the stresssubordination convention, the theory of disjunctive ordering, and the use of crucial variables in phonological rules. Our theory will employ two basic ideas about the representation of traditional prosodic concepts: first, we represent the notion
The wizard of TILT: Efficient(?), convenient and abstract type representations
, 2002
"... The TILT compiler for Standard ML is typedirected and typepreserving, that is, it makes use of and translates type information during the phases of compilation. Unfortunately, such use of type data incurs a significant overhead. This paper explores methods for abstractly, conveniently, and efficie ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
The TILT compiler for Standard ML is typedirected and typepreserving, that is, it makes use of and translates type information during the phases of compilation. Unfortunately, such use of type data incurs a significant overhead. This paper explores methods for abstractly, conveniently
Multiresolution Curves
, 1994
"... We describe a multiresolution curve representation, based on wavelets, that conveniently supports a variety of operations: smoothing a curve; editing the overall form of a curve while preserving its details; and approximating a curve within any given error tolerance for scan conversion. We present m ..."
Abstract

Cited by 174 (5 self)
 Add to MetaCart
We describe a multiresolution curve representation, based on wavelets, that conveniently supports a variety of operations: smoothing a curve; editing the overall form of a curve while preserving its details; and approximating a curve within any given error tolerance for scan conversion. We present
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
and sensitivity encoding. That is, no restrictions are made as to the coil configuration and the sampling pattern in kspace. Two reconstruction strategies are discussed. The first approach strictly aims at optimal voxel shape and is called strong reconstruction for convenience. In weak reconstruction, the voxel
Results 1  10
of
1,890