Results 1  10
of
15,599
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 506 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
A Graduated Assignment Algorithm for Graph Matching
, 1996
"... A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational comp ..."
Abstract

Cited by 373 (15 self)
 Add to MetaCart
complexity [O(lm), where l and m are the number of links in the two graphs] and robustness in the presence of noise offer advantages over traditional combinatorial approaches. The algorithm, not restricted to any special class of graph, is applied to subgraph isomorphism, weighted graph matching
Stock Markets, Banks, and Economic Growth
, 1998
"... This paper  a product of the Finance and Private Sector Development Division, Policy Research Department  is pa't of a larger effort in the department to understand the links between the financial system and economic growth. The study was funded by the Bank's Research Support Budget un ..."
Abstract

Cited by 351 (20 self)
 Add to MetaCart
This paper  a product of the Finance and Private Sector Development Division, Policy Research Department  is pa't of a larger effort in the department to understand the links between the financial system and economic growth. The study was funded by the Bank's Research Support Budget
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 347 (21 self)
 Add to MetaCart
A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n
Visibility Preprocessing For Interactive Walkthroughs
 IN: COMPUTER GRAPHICS (SIGGRAPH 91 PROCEEDINGS
, 1991
"... The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g., walls), only a small fraction of atypical model is visible from most viewpoints. We describe a method of visibility pre ..."
Abstract

Cited by 332 (16 self)
 Add to MetaCart
nfthesubdivisicm. Next. theccl/r/~cc/ / visibility is computed for each cell of the subdivisirrn, by linking pairs of cells between which unobstructed.si,q/~t/inr. ~exist. During an interactive ww/krhrm/,q/~phase, an observer with a known ~~sition and\it)M~~~)~t>mov esthrc>ughthe model. At each frame
Unitary SpaceTime Modulation for MultipleAntenna Communications in Rayleigh Flat Fading
 IEEE Trans. Inform. Theory
, 1998
"... Motivated by informationtheoretic considerations, we propose a signalling scheme, unitary spacetime modulation, for multipleantenna communication links. This modulation is ideally suited for Rayleigh fastfading environments, since it does not require the receiver to know or learn the propagation ..."
Abstract

Cited by 308 (18 self)
 Add to MetaCart
Motivated by informationtheoretic considerations, we propose a signalling scheme, unitary spacetime modulation, for multipleantenna communication links. This modulation is ideally suited for Rayleigh fastfading environments, since it does not require the receiver to know or learn
Generalization Of An Inequality By Talagrand, And Links With The Logarithmic Sobolev Inequality
 J. Funct. Anal
, 2000
"... . We show that transport inequalities, similar to the one derived by Talagrand [30] for the Gaussian measure, are implied by logarithmic Sobolev inequalities. Conversely, Talagrand's inequality implies a logarithmic Sobolev inequality if the density of the measure is approximately logconcave, ..."
Abstract

Cited by 244 (12 self)
 Add to MetaCart
. Main results 5 3. Heuristics 11 4. Proof of Theorem 1 18 5. Proof of Theorem 3 24 6. An application of Theorem 1 30 7. Linearizations 31 Appendix A. A nonlinear approximation argument 35 References 36 1. Introduction Let M be a smooth complete Riemannian manifold of dimension n, with the geodesic
MTCP: TCP for Mobile Cellular Networks
 Computer Communication Review
, 1997
"... Transport connections set up over wireless links are frequently plagued by problems such as { high bit error rate (BER), frequent disconnections of the mobile user, and low wireless bandwidth that may change dynamically. In this paper, we study the e ects of frequent disconnections and low variable ..."
Abstract

Cited by 244 (2 self)
 Add to MetaCart
Transport connections set up over wireless links are frequently plagued by problems such as { high bit error rate (BER), frequent disconnections of the mobile user, and low wireless bandwidth that may change dynamically. In this paper, we study the e ects of frequent disconnections and low variable
A spectral technique for correspondence problems using pairwise constraints
 In International Conference on Computer Vision
, 2005
"... Abstract We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the potential correspondences and the weights on the links represent pairwise agreements between potential correspon ..."
Abstract

Cited by 251 (10 self)
 Add to MetaCart
Abstract We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the potential correspondences and the weights on the links represent pairwise agreements between potential
Results 1  10
of
15,599