Results 1  10
of
260
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
of its ideal counterpart: where Id n v denotes n V ϫ n V identity. By this condition the reconstruction matrix F is generally not yet entirely determined. It leaves n C n K n V degrees of freedom per voxel, which may be utilized for SNR optimization. To that end each diagonal element of the image noise
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
jk be the proportion of all paths linking actors j and k which pass through actor i. The betweenness of actor i is defined as the sum of all b jk where i, j, and k are distinct. It is normalized by dividing by the maximum betweenness in an nactor network. II. Sample and Data Data for our analysis
The L(2,1)Labeling Problem on Graphs
, 1993
"... An L(2; 1)labeling of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that jf(x) 0 f(y)j 2 if d(x; y) = 1 and jf(x) 0 f(y)j 1 if d(x; y) = 2. The L(2; 1)labeling number (G) of G is the smallest number k such that G has a L(2; 1)labeling with max ..."
Abstract

Cited by 108 (2 self)
 Add to MetaCart
An L(2; 1)labeling of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that jf(x) 0 f(y)j 2 if d(x; y) = 1 and jf(x) 0 f(y)j 1 if d(x; y) = 2. The L(2; 1)labeling number (G) of G is the smallest number k such that G has a L(2; 1)labeling
Collection Tree Protocol
"... This paper presents and evaluates two principles for designing robust, reliable, and efficient collection protocols. These principles allow a protocol to benefit from accurate and agile link estimators by handling the dynamism such estimators introduce to routing tables. The first is datapath valida ..."
Abstract
 Add to MetaCart
latency. We study these mechanisms in an implementation called Collection Tree Protocol (CTP) and evaluate their contributions to its performance. We evaluate CTP on 12 different testbeds ranging in size from 20–310 nodes and comprising 7 hardware platforms, on 6 different link layers, and on interference
3 ON THE MAXIMUM ORDERS OF ELEMENTS OF FINITE ALMOST SIMPLE GROUPS AND PRIMITIVE PERMUTATION GROUPS
"... ar ..."
A TwoStep Estimation Procedure and a GoodnessofFit Test for Spatial Extremes Models
"... Parametric maxstable processes are increasingly used to model spatial extremes. Since the dependence structure is specified for block maxima, the data used for inference are block maxima from all sites. To improve the estimation efficiency, we propose a twostep approach with composite likelihood t ..."
Abstract
 Add to MetaCart
Parametric maxstable processes are increasingly used to model spatial extremes. Since the dependence structure is specified for block maxima, the data used for inference are block maxima from all sites. To improve the estimation efficiency, we propose a twostep approach with composite likelihood that utilizes sitewise daily records in addition to block maxima. Besides the parameter estimation, there is no formal model checking and diagnosis method for spatial extremes modeling yet. Model diagnosis in practice has been informal and mostly based on visual checking tools such as residual plot and quantilequantile plot. We proposed a goodnessoffit test for maxstable processes based on the comparison between a nonparametric and a parametric estimator of the corresponding unknown multivariate Pickands dependence function. The proposed twostep procedure separates the estimation of marginal parameters and dependence parameters into two steps. The first step estimates the marginal parameters with an independence Likelihood by ignoring the spatial dependence. Given ithe marginal parameter estimates, the second step estimates the dependence parameters
i i
"... , and we can say the Campbell bandwidth is the minimum average bandwidth for encoding the process across all possible distortion levels. IX. CONCLUSION We have presented two new derivations of the coefficient rate introduced by Campbell. One derivation solidifies its interpretation as a coefficien ..."
Abstract
 Add to MetaCart
, and we can say the Campbell bandwidth is the minimum average bandwidth for encoding the process across all possible distortion levels. IX. CONCLUSION We have presented two new derivations of the coefficient rate introduced by Campbell. One derivation solidifies its interpretation as a coefficient rate, and shows that the spectral entropy of a random process is proportional to the logarithm of the equivalent bandwidth of the smallest frequency band that contains most of the energy. The second derivation implies that the number of samples of a particular component should be proportional to the variance of that component. We discussed the implications of the latter result for realizationadaptive source coding and provided a connection with the familiar reverse waterfilling result from rate distortion theory. From the coefficient rate, we defined a quantity called the Campbell bandwidth of a random process, and we contrasted Fourier bandwidth, Shannon bandwidth, and Campbell bandwidth. ACKNOWLEDGMENT The authors are indebted to the referees for their constructive comments and insights.
1MIMO Multiway Relaying with Clustered Full Data Exchange: Signal Space Alignment and Degrees of Freedom
"... Abstract—We investigate achievable degrees of freedom (DoF) for a multipleinput multipleoutput (MIMO) multiway relay channel (mRC) with L clusters andK users per cluster. Each user is equipped with M antennas and the relay with N antennas. We assume a new data exchange model, termed clustered full ..."
Abstract
 Add to MetaCart
Abstract—We investigate achievable degrees of freedom (DoF) for a multipleinput multipleoutput (MIMO) multiway relay channel (mRC) with L clusters andK users per cluster. Each user is equipped with M antennas and the relay with N antennas. We assume a new data exchange model, termed clustered
Supervised by
, 2007
"... I would like to thank my parents for always believing in me. I would also like to thank my supervisors Richard Lindner and Johannes Buchmann for their useful comments and suggestions on how to improve the queality of the thesis. Not on last place I would like to thank Vadim Lyubashevsky and Luis Car ..."
Abstract
 Add to MetaCart
I would like to thank my parents for always believing in me. I would also like to thank my supervisors Richard Lindner and Johannes Buchmann for their useful comments and suggestions on how to improve the queality of the thesis. Not on last place I would like to thank Vadim Lyubashevsky and Luis Carlos Coronado Garcia for their kindness and readiness to answer my questions. Warranty I hereby warrant that the content of this thesis is the direct result of my own work and that any use made in it of published or unpublished material is fully and correctly referenced. I also warrant that the presented work has
Results 1  10
of
260