We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map F with respect to the lexicographic order on R and we add a variant of the logarithmquadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced on the quadratic term and ...

We propose a multivariate model for the number of hits on a set of popular websites, and show it to accurately reflect the behavior recorded in a data set of Internet users in the United States. We assume that the random vector of visits is distributed according to a censored multivariate normal with marginals transformed to be discrete Pareto IV and, following the ideas of Gaussian graphical m...

In this paper we prove that Neville elimination can be matricially described by elementary matrices. A PLU-factorization is obtained for any n×m matrix, where P is a permutation matrix, L is a lower triangular matrix (product of bidiagonal factors) and U is an upper triangular matrix. This result generalizes the Neville factorization usually applied to characterize the totally positive matrices...

How best to efficiently establish correspondence among a large set of images or video frames is an interesting unanswered question. For large databases, the high computational cost of performing pair-wise image matching is a major problem. However, for many applications, images are inherently sparsely connected, and so current techniques try to correctly estimate small potentially matching subs...

In this paper, we explore statistical versus computational trade-off to address a basic question in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing spline setup, we observe a phase transition phenomenon for the number of deployed machines that ends up being a simple proxy for computing cost. Specifically, a sha...

The ‘order-N’ or ‘linear-systemsize-scaling’ methods 1) are electronic-structure calculations in which the computational cost is ‘O(N)’, or linearly proportional to the system-size N . In conventional schemes, the computational cost should be O(N), because of the matrix-diagonalization procedures or the orthogonalization constraints of the wavefunctions. The aim of order-N methods is to calcula...

When developing an index for a similarity search in metric spaces, how to divide the space for effective search pruning is a fundamental issue. We present Maximal Metric Margin Partitioning (MMMP), a partitioning scheme for similarity search indexes. MMMP divides the data based on its distribution pattern, especially for the boundaries of clusters. A partitioning boundary created by MMMP is lik...

The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous minimization of the numbers of exceptions and voids, and minimization of intercell moves and within-cell...

Spectral efficiency of low-density spreading non-orthogonal multiple access channels in the presence of fading is derived for linear detection with independent decoding as well as optimum decoding. The large system limit, where both the number of users and number of signal dimensions grow with fixed ratio, called load, is considered. In the case of optimum decoding, it is found that low-density...

We present an investigation of gauge invariant smearing for Wilson fermions on a 24 × 48 lattice at β = 6.2. We demonstrate a smearing algorithm that allows a substantial improvement in the determination of the baryon spectrum obtained using propagators smeared at both source and sink, at only a small computational cost. We investigate the matrix of correlators constructed from local and smeare...