Results 1  10
of
5,729
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 1010 (2 self)
 Add to MetaCart
are worth striving for. It is shown that these features can be obtained by constructing a matrix with a certain “Property U.” Matrices having this property are exhibited for the equations of steady and unsteady gasdynamics. In order to construct them, it is found helpful to introduce “parameter vectors
Support vector machine active learning for image retrieval
, 2001
"... Relevance feedback is often a critical component when designing image databases. With these databases it is difficult to specify queries directly and explicitly. Relevance feedback interactively determinines a user’s desired output or query concept by asking the user whether certain proposed images ..."
Abstract

Cited by 456 (28 self)
 Add to MetaCart
Relevance feedback is often a critical component when designing image databases. With these databases it is difficult to specify queries directly and explicitly. Relevance feedback interactively determinines a user’s desired output or query concept by asking the user whether certain proposed images
The Stability of Certain Vector Bundles on MultiProjective Spaces
"... Abstract. Here we study the stability of certain homogeneous vector bundles on multiprojective spaces using their restriction to certain rational curves. ..."
Abstract
 Add to MetaCart
Abstract. Here we study the stability of certain homogeneous vector bundles on multiprojective spaces using their restriction to certain rational curves.
On a certain vector crank modulo 7
"... We define a vector crank to provide a combinatorial interpretation for a certain Ramanujan type congruence modulo 7. ..."
Abstract
 Add to MetaCart
We define a vector crank to provide a combinatorial interpretation for a certain Ramanujan type congruence modulo 7.
Bijective proofs of certain vector partition identities
 Pacific J. Math
, 1982
"... Known generating functions for certain families of rpartite (vector) partitions are derived using a simple combinatorial bijection. This same technique is seen to apply to various new partition identities as well. 1 * Introduction * Let the nonnegative integers be denoted by N = {0, 1, 2, •}. Give ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Known generating functions for certain families of rpartite (vector) partitions are derived using a simple combinatorial bijection. This same technique is seen to apply to various new partition identities as well. 1 * Introduction * Let the nonnegative integers be denoted by N = {0, 1, 2
Nuclearity of certain vectorvalued sequence spaces
"... In this note, we deal with the space of Λsummable sequences from a locally convex space E, where Λ is a perfect sequence space. We make use of a result of M. Florencio and Pedro J. Paúl in [4] to give a characterization of the nuclearity of Λ(E) in terms of that of Λ and E and the AK property. ..."
Abstract
 Add to MetaCart
In this note, we deal with the space of Λsummable sequences from a locally convex space E, where Λ is a perfect sequence space. We make use of a result of M. Florencio and Pedro J. Paúl in [4] to give a characterization of the nuclearity of Λ(E) in terms of that of Λ and E and the AK property.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 949 (19 self)
 Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NPhard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds
Testing for Common Trends
 Journal of the American Statistical Association
, 1988
"... Cointegrated multiple time series share at least one common trend. Two tests are developed for the number of common stochastic trends (i.e., for the order of cointegration) in a multiple time series with and without drift. Both tests involve the roots of the ordinary least squares coefficient matrix ..."
Abstract

Cited by 464 (7 self)
 Add to MetaCart
similar. The firstest (qf) is developed under the assumption that certain components of the process have a finiteorder vector autoregressive (VAR) representation, and the nuisance parameters are handled by estimating this VAR. The second test (q,) entails computing the eigenvalues of a corrected sample
Submodular functions, matroids and certain polyhedra
, 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
of linear programming. It turns out to be useful to regard “pure matroid theory”, which is only incidentally related to the aspects of algebra which it abstracts, as the study of certain classes of convex polyhedra. (1) A matroid M = (E,F) can be defined as a finite set E and a nonempty family F of so
Results 1  10
of
5,729