We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence

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

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

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 is proposed to maintain a collection of vertex-disjoint 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

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

Motivated by information-theoretic considerations, we propose a signalling scheme, unitary space-time modulation, for multiple-antenna communication links. This modulation is ideally suited for Rayleigh fast-fading environments, since it does not require the receiver to know or learn

. 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

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 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