• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 14,960
Next 10 →

CONTINUED FRACTIONS AND EINSTEIN MANIFOLDS OF INFINITE TOPOLOGICAL TYPE

by David M. J. Calderbank, Michael, A. Singer , 2005
"... Abstract. We present a construction of complete self-dual Einstein metrics of negative scalar curvature on an uncountable family of manifolds of infinite topological type. 1. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. We present a construction of complete self-dual Einstein metrics of negative scalar curvature on an uncountable family of manifolds of infinite topological type. 1.

On various Teichmüller spaces of a surface of infinite topological type

by D. Alessandrini, L. Liu, A. Papadopoulos, W. Su - Proc. Amer. Math. Soc. 140 (2012), 561–574. SPACE 19 hal-00664093, version 1 - 28 , 2012
"... ar ..."
Abstract - Cited by 5 (5 self) - Add to MetaCart
Abstract not found

Vol. 102, No. 3 DUKE MATHEMATICAL JOURNAL © 2000 EXAMPLES WITH BOUNDED DIAMETER GROWTH AND INFINITE TOPOLOGICAL TYPE

by X. Menguy
"... 0. Introduction. In this paper, we construct an example of an open manifold with positive Ricci curvature, infinite topological type, and bounded diameter growth. Let Mn be an open manifold with base point p ∈ Mn.Forr>0, denote by C(p,r) the union of the unbounded components of Mn \Br(p). U. Abre ..."
Abstract - Add to MetaCart
0. Introduction. In this paper, we construct an example of an open manifold with positive Ricci curvature, infinite topological type, and bounded diameter growth. Let Mn be an open manifold with base point p ∈ Mn.Forr>0, denote by C(p,r) the union of the unbounded components of Mn \Br(p). U

Mobility increases the capacity of ad-hoc wireless networks

by Matthias Grossglauser, David Tse - IEEE/ACM TRANSACTIONS ON NETWORKING , 2002
"... The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughpu ..."
Abstract - Cited by 1220 (5 self) - Add to MetaCart
-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a

New results in linear filtering and prediction theory

by R. E. Kalman, R. S. Bucy - TRANS. ASME, SER. D, J. BASIC ENG , 1961
"... A nonlinear differential equation of the Riccati type is derived for the covariance matrix of the optimal filtering error. The solution of this "variance equation " completely specifies the optimal filter for either finite or infinite smoothing intervals and stationary or nonstationary sta ..."
Abstract - Cited by 607 (0 self) - Add to MetaCart
A nonlinear differential equation of the Riccati type is derived for the covariance matrix of the optimal filtering error. The solution of this "variance equation " completely specifies the optimal filter for either finite or infinite smoothing intervals and stationary or nonstationary

Constrained model predictive control: Stability and optimality

by D. Q. Mayne, J. B. Rawlings, C. V. Rao, P. O. M. Scokaert - AUTOMATICA , 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon open-loop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract - Cited by 738 (16 self) - Add to MetaCart
and the first control in this sequence is applied to the plant. An important advantage of this type of control is its ability to cope with hard constraints on controls and states. It has, therefore, been widely applied in petro-chemical and related industries where satisfaction of constraints is particularly

A Signal Processing Approach To Fair Surface Design

by Gabriel Taubin , 1995
"... In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing, or fai ..."
Abstract - Cited by 654 (15 self) - Add to MetaCart
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing

Adaptive clustering for mobile wireless networks

by Chunhung Richard Lin, Mario Gerla - IEEE Journal on Selected Areas in Communications , 1997
"... This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract - Cited by 561 (11 self) - Add to MetaCart
reconfigured as nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Secondly, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological

Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations

by Stanley Osher, James A. Sethian , 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract - Cited by 1183 (60 self) - Add to MetaCart
in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be also used for more general Hamilton-Jacobi-type problems. We demonstrate our algorithms

Macroscopic strings as heavy quarks in large N gauge theory and Anti-de Sitter supergravity

by Soo-jong Rey, Jung-tay Yee - PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and anti-de Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3-brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract - Cited by 508 (1 self) - Add to MetaCart
macroscopic strings as heavy (anti)-quark probes. The macroscopic strings are semi-infinite Type IIB strings ending on D3-brane world-volume. We first study deformation and fluctuation of D3-brane when a macroscopic BPS string is attached. We find that both dynamics and boundary conditions agree with those
Next 10 →
Results 1 - 10 of 14,960
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University