Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,511
GLOBAL DYNAMICS OF THE CHEMOSTAT WITH VARIABLE YIELDS
"... Abstract. In this paper, we consider a competition model between n species inachemostat includingboth monotone and non-monotone responsefunctions, distinct removal rates and variable yields. We show that only the species with the lowest break-even concentration survives, provided that additional tec ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. In this paper, we consider a competition model between n species inachemostat includingboth monotone and non-monotone responsefunctions, distinct removal rates and variable yields. We show that only the species with the lowest break-even concentration survives, provided that additional
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
, 2001
"... Variable selection is fundamental to high-dimensional statistical modeling, including nonparametric regression. Many approaches in use are stepwise selection procedures, which can be computationally expensive and ignore stochastic errors in the variable selection process. In this article, penalized ..."
Abstract
-
Cited by 948 (62 self)
- Add to MetaCart
Variable selection is fundamental to high-dimensional statistical modeling, including nonparametric regression. Many approaches in use are stepwise selection procedures, which can be computationally expensive and ignore stochastic errors in the variable selection process. In this article, penalized
Approximating discrete probability distributions with dependence trees
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an n-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set of n-1 first order dependence relationship among the n variables ..."
Abstract
-
Cited by 881 (0 self)
- Add to MetaCart
variables. It is shown that the procedure derived in this paper yields an approximation of a minimum difference in information. It is further shown that when this procedure is applied to empirical observations from an unknown distribution of tree dependence, the procedure is the maximum-likelihood estimate
Determining the Number of Factors in Approximate Factor Models
, 2000
"... In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors c ..."
Abstract
-
Cited by 561 (30 self)
- Add to MetaCart
can be consistently estimated using the criterion. The theory is developed under the framework of large cross-sections (N) and large time dimensions (T). No restriction is imposed on the relation between N and T. Simulations show that the proposed criterion yields almost precise estimates
Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes
, 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract
-
Cited by 517 (78 self)
- Add to MetaCart
A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used
Random forests
- Machine Learning
, 2001
"... Abstract. Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the fo ..."
Abstract
-
Cited by 3613 (2 self)
- Add to MetaCart
in the forest becomes large. The generalization error of a forest of tree classifiers depends on the strength of the individual trees in the forest and the correlation between them. Using a random selection of features to split each node yields error rates that compare favorably to Adaboost (Y. Freund & R
View-Based and Modular Eigenspaces for Face Recognition
- IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION & PATTERN RECOGNITION
, 1994
"... In this work we describe experiments with eigenfaces for recognition and interactive search in a large-scale face database. Accurate visual recognition is demonstrated using a database of o(10^3) faces. The problem of recognition under general viewing orientation is also explained. A view-based mul ..."
Abstract
-
Cited by 781 (15 self)
- Add to MetaCart
-based multiple-observer eigenspace technique is proposed for use in face recognition under variable pose. In addition, a modular eigenspace description technique is used which incorporates salient features such as the eyes, nose, mouth, in a eigenfeature layer. This modular representation yields higher
The inductive approach to verifying cryptographic protocols
- Journal of Computer Security
, 1998
"... Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as ..."
Abstract
-
Cited by 480 (29 self)
- Add to MetaCart
be as little as a week or two, yielding a proof script that takes a few minutes to run. Protocols are inductively defined as sets of traces. A trace is a list of communication events, perhaps comprising many interleaved protocol runs. Protocol descriptions incorporate attacks and accidental losses. The model
Performance Evaluation of Adaptive EY-NPMA with Variable Yield
"... Abstract: Wireless Local Area Networks (WLANs) have known an impressive increase in popularity during the past decade. An important factor defining the performance of such a network is the Medium Access protocol used, which defines the efficiency with which the raw bandwidth is shared between the us ..."
Abstract
- Add to MetaCart
the users. In this paper a modified version of EY-NPMA is proposed and analysed, which employs a non-constant distribution during the yield phase, coupled to the elimination phase length. The evaluation of the analytical model shows that this approach leads to significant gains regarding throughput
Results 1 - 10
of
11,511
