Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
10,353
The proper orthogonal decomposition in the analysis of turbulent flows
- Annual Rev. Fluid Mech
, 1993
"... 1.1 The Problems of Turbulence It has often been remarked that turbulence is a subject of great scientific and technological importance, and yet one of the least understood (e.g. McComb 1990). To an outsider this may seem strange, since the basic ..."
Abstract
-
Cited by 312 (3 self)
- Add to MetaCart
1.1 The Problems of Turbulence It has often been remarked that turbulence is a subject of great scientific and technological importance, and yet one of the least understood (e.g. McComb 1990). To an outsider this may seem strange, since the basic
Space-time block coding for wireless communications: performance results
- IEEE J. Select. Areas. Commun
, 1999
"... Abstract—We document the performance of space–time block codes [13], [14], which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code, and the encoded data is split into n streams which are simultaneousl ..."
Abstract
-
Cited by 369 (13 self)
- Add to MetaCart
joint detection. This uses the orthogonal structure of the space–time block code and gives a maximum likelihood decoding algorithm which is based only on linear processing at the receiver. We review the encoding and decoding algorithms for various codes and provide simulation results demonstrating
A Simple Panel Unit Root Test in the Presence of Cross Section Dependence
- JOURNAL OF APPLIED ECONOMETRICS
, 2006
"... A number of panel unit root tests that allow for cross section dependence have been proposed in the literature that use orthogonalization type procedures to asymptotically eliminate the cross dependence of the series before standard panel unit root tests are applied to the transformed series. In thi ..."
Abstract
-
Cited by 372 (16 self)
- Add to MetaCart
A number of panel unit root tests that allow for cross section dependence have been proposed in the literature that use orthogonalization type procedures to asymptotically eliminate the cross dependence of the series before standard panel unit root tests are applied to the transformed series
On-demand Multipath Distance Vector Routing in Ad Hoc Networks
- in Proceedings of IEEE International Conference on Network Protocols (ICNP
, 2001
"... We develop an on-demand, multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The resulting protocol is referred to as Ad hoc Ondemand Multipath Di ..."
Abstract
-
Cited by 360 (3 self)
- Add to MetaCart
Distance Vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loopfreedom is guaranteed by using a notion of "advertised hopcount." Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV
Agent theories, architectures, and languages: a survey
, 1995
"... The concept of an agent has recently become important in Artificial Intelligence (AI), and its relatively youthful subfield, Distributed AI (DAI). Our aim in this paper is to point the reader at what we perceive to be the most important theoretical and practical issues associated with the design and ..."
Abstract
-
Cited by 321 (2 self)
- Add to MetaCart
about the properties of agents. Agent architectures can be thought of as software engineering models of agents; researchers in this area are primarily concerned with the problem of constructing software or hardware systems that will satisfy the properties specified by agent theorists. Finally, agent
Sure independence screening for ultra-high dimensional feature space
, 2006
"... Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper, ..."
Abstract
-
Cited by 283 (26 self)
- Add to MetaCart
, Candes and Tao (2007) propose the Dantzig selector using L1 regularization and show that it achieves the ideal risk up to a logarithmic factor log p. Their innovative procedure and remarkable result are challenged when the dimensionality is ultra high as the factor log p can be large and their uniform
The group Lasso for logistic regression
- Journal of the Royal Statistical Society, Series B
, 2008
"... Summary. The group lasso is an extension of the lasso to do variable selection on (predefined) groups of variables in linear regression models. The estimates have the attractive property of being invariant under groupwise orthogonal reparameterizations. We extend the group lasso to logistic regressi ..."
Abstract
-
Cited by 276 (11 self)
- Add to MetaCart
Summary. The group lasso is an extension of the lasso to do variable selection on (predefined) groups of variables in linear regression models. The estimates have the attractive property of being invariant under groupwise orthogonal reparameterizations. We extend the group lasso to logistic
Full Abstraction for PCF
- INFORMATION AND COMPUTATION
, 1996
"... An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "history-free" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable i ..."
Abstract
-
Cited by 254 (16 self)
- Add to MetaCart
in a certain simple extension of PCF. We then introduce an intrinsic preorder on strategies, and show that it satisfies some remarkable properties, such that the intrinsic preorder on function types coincides with the pointwise preorder. We then obtain an order-extensional fully abstract model of PCF
A remark on the restricted isometry property in orthogonal matching pursuit
- IEEE Trans. Information Theory
, 2012
"... ar ..."
Remarks on orthogonal convexity of Banach spaces, Nonlinear Anal
, 1998
"... ABSTRACT. It is proved that orthogonal convexity defined by A. Jimenez-Melado and E. Llorens-Fuster implies the weak Banach-Saks property. Rela-tions between orthogonal convexity and another geometric properties, such as nearly uniform smoothness and property (•), are studied. Introduction. Orthogon ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
ABSTRACT. It is proved that orthogonal convexity defined by A. Jimenez-Melado and E. Llorens-Fuster implies the weak Banach-Saks property. Rela-tions between orthogonal convexity and another geometric properties, such as nearly uniform smoothness and property (•), are studied. Introduction
Results 11 - 20
of
10,353
