a t-spanner of T. The MMN Problem for T is exactly the problem to compute the 1-spanner of T under the L1-norm. Motivation: The spanners and the MMN ...
Abstract. This paper considers the optimal control problem of minimizing control effort subject to multiple performance constraints on output covariance matrices ...
Aug 27, 1997 - To introduce the minimum-revenue road pricing problem, we review ... The tolls cmx are marginal-cost congestion prices; we call them MC tolls.
by USGS, in which the Tricorder 3.3 software product was used to map different minerals present in the Cuprite mining district6. The 250 Ã 190-pixel subscene ...
2Department of Mathematics and Computer Science, University of. Antwerp, Middelheimlaan ... the cloud, relative to the size of the cloud. Here. ¯x is the sample ...
Email: [email protected]. We first give the minimum searching algorithm, then the proof of the probability of success. Quantum Minimum Searching Algorithm.
cently a fast algorithm for graph clustering has been sug- gested in [5] on the ... problem, using minimum-cut, maximum-flow problem of the underlying graph.
have discovered a new min-cost multicommodity ow algorithm 8]. Their algorithm ..... An approximate max- ow min-cut theorem for uniform multicom- modity ow ...
statistical analysis, robust estimators of shape/scatter can be used to construct robust multivariate ... estimator, where the estimates are given by the mean and covariance matrix of that ...... Hodges JL (eds.) A festschrift for Erich Lehmann.
electronically on the Internet by The MIT Press, Cambridge, Massachusetts, 02142. ..... empirical results by providing copies of data and programs online.
Jan 24, 2017 - Faculty of Economics and Business, Vrije Universiteit Amsterdam ... âfat dataâ, in which the number of rows (observations) is small ...... We see that MRCD regression on all predictors has effectively flagged Arkansas and Nevada. .
hindsight. What is more, it is only from such a perspective that we see what the opti- ... cal value obtained for the decision which, with hindsight, would have been ...
The minimum convex-cost network flow problem (MC-CNFP) is a class of minimum ... problems such that cost of power interruption in electrical supply networks, ...
Email address: [email protected], telephone: (603) 646-3385. yPart of this work was done while this author was with the Mathematics and Computer ...
on the true covariance of the fused estimate and prove that. Covariance Intersection (CI) is the optimal bounding algorithm for two estimates under completely ...
a function to a set of data optimally and to characterize the statistical .... holds for all t where Mλ is a positive constant number. ..... The θ0 is the y-intercept of the.
[email protected]. Abstract. ..... the node potential functions ½ and ¾ for free by using the dual and negative dual ... is exactly the vector of reduced costs .
Oct 8, 2007 - Despite the NP hardness of acquiring minimum distance dm for linear ... Many methods have been proposed to estimate dm of linear codes.
Mar 10, 1998 - In the minimum fill-in problem, one wishes to find a set of edges of smallest size, ...... max-flow min-cut theorem for uniform multicommodity flow.
For each Bi, 1 ⤠i ⤠l, applying Algorithm II, we can compute a collection of candidate sets. FBi u. = {FBi .... W.
In this paper, we study the minimum-weight feedback vertex set problem in ...... ISAAC'95 Algorthms and Computations, Le
Abstract. In this paper we present a branch-and-bound algorithm for nding the minimum crossing number of a graph. We begin with the vertex set and add edges ...
1986; revised February 5. 1987. An algorithm is presented for the rapid
evaluation of the potential and force fields in systems involving large numbers of
particles ...
A dynamically adaptive multilevel wavelet collocation method for the solution of partial ... Let us consider a function u(x) defined on a closed interval. [X1 , X2].
