Results 1  10
of
1,285
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
, samples of distinct information content can be obtained at one time by using distinct receivers in parallel (2), implying the possibility of reducing scan time in Fourier imaging without having to travel faster in kspace. In 1988 Hutchinson and Raff (3) suggested dispensing entirely with phase encoding
Compact Visibility Representation of Plane Graphs
 STACS
, 2011
"... The visibility representation (VR for short) is a classical representation of plane graphs. It has various applications and has been extensively studied. A main focus of the study is to minimize the size of the VR. It is known that there exists a plane graph G with n vertices where any VR of G requi ..."
Abstract
 Add to MetaCart
The visibility representation (VR for short) is a classical representation of plane graphs. It has various applications and has been extensively studied. A main focus of the study is to minimize the size of the VR. It is known that there exists a plane graph G with n vertices where any VR of G
On a Visibility Representation for Graphs in Three Dimensions
, 1993
"... Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. Application areas such as VLSI wire routing and circuit board layout have stimulated research on visibility representations where the sets belong to R². Here, ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. Application areas such as VLSI wire routing and circuit board layout have stimulated research on visibility representations where the sets belong to R². Here
VCdimension of Exterior Visibility
 IEEE Trans. Pattern Analysis and Machine Intelligence
, 2004
"... In this paper, we study the VapnikChervonenkis (VC)dimension of set systems arising in 2D polygonal and 3D polyhedral configurations where a subset consists of all points visible from one camera. In the past, it has been shown that the VCdimension of planar visibility systems is bounded by 23 if t ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
the polygon (VCdimension=2) or lying outside the convex hull of a polygon (VCdimension= 5). The main result of this paper concerns the 3D case: we prove that the VCdimension is unbounded if the cameras lie on a sphere containing the polyhedron, hence the term exterior visibility.
VCdimension of visibility on terrains
 In Proc. 20th Canadian Conference on Comput. Geom
, 2008
"... A guarding problem can naturally be modeled as a set system (U, S) in which the universe U of elements is the set of points we need to guard and our collection S of sets contains, for each potential guard g, the set of points from U seen by g. We prove bounds on the maximum VCdimension of set syste ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
systems associated with guarding both 1.5D terrains (monotone chains) and 2.5D terrains (polygonal terrains). We prove that for monotone chains, the maximum VCdimension is 4 and that for polygonal terrains, the maximum VCdimension is unbounded. 1
Visibility representation of plane graphs with . . .
, 2012
"... The visibility representation (VR for short) is a classical representation of plane graphs. It has various applications and has been extensively studied. A main focus of the study is to minimize the size of the VR. The trivial upper bound is (n−1)×(2n−5)(height × width). It is known that there exist ..."
Abstract
 Add to MetaCart
The visibility representation (VR for short) is a classical representation of plane graphs. It has various applications and has been extensively studied. A main focus of the study is to minimize the size of the VR. The trivial upper bound is (n−1)×(2n−5)(height × width). It is known
Wilson loops of antisymmetric representation and D5branes,” arXiv:hepth/0603208
 J. Gomis and F. Passerini, “Holographic Wilson
"... We use a D5brane with electric flux in AdS5 × S5 background to calculate the circular Wilson loop of antisymmetric representation in N = 4 super YangMills theory in 4 dimensions. The result agrees with the Gaussian matrix model calculation. 1 Introduction and summary The expectation values of Wil ..."
Abstract

Cited by 114 (6 self)
 Add to MetaCart
We use a D5brane with electric flux in AdS5 × S5 background to calculate the circular Wilson loop of antisymmetric representation in N = 4 super YangMills theory in 4 dimensions. The result agrees with the Gaussian matrix model calculation. 1 Introduction and summary The expectation values
Rectangle and Box Visibility Graphs in 3D
 INTERNAT. J. COMPUT. GEOM. APPL
, 1996
"... We discuss rectangle and box visibility representations of graphs in 3dimensional space. In these representations, vertices are represented by axisaligned disjoint rectangles or boxes. Two vertices are adjacent if and only if their corresponding boxes see each other along a small axisparallel ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We discuss rectangle and box visibility representations of graphs in 3dimensional space. In these representations, vertices are represented by axisaligned disjoint rectangles or boxes. Two vertices are adjacent if and only if their corresponding boxes see each other along a small axis
Results 1  10
of
1,285