Applying k-Means to minimize the sum of the intra-cluster variances is the most popular clustering approach. However, after a bad initialization, poor local optima can be easily obtained. To tackle the initialization problem of k-Means, we propose the MinMax k-Means algorithm, a method that assigns weights to the clusters relative to their variance and optimizes a weighted version of the k-Mean...

The paper studies the problem of reachability for linear systems in the presence of uncertain input disturbances that may also be interpreted as the action of an adversary in a game-theoretic setting. It emphasizes the differences between reachability under open-loop and closed-loop control. The situation when observations arrive at given isolated instances of time, leads to problems of anticip...

Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...

Parametric-linkage analysis applied to large pedigrees with many affected individuals has helped in the identification of highly penetrant genes; but, for diseases lacking a clear Mendelian inheritance pattern or caused by several genes of low to moderate penetrance, a more robust strategy is nonparametric analysis applied to small sets of affected relatives, such as affected sib pairs. Here we...

This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear and convex rate-distortion functions, LP is used to generate optimal solutions for the minmax problem under VBR buffer constraints. The LP solution for this problem avoids an explicit search for the minimum distortion va...

This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between thes...

This paper evaluates the accuracy of several RSSI-based localization techniques on a live jobsite and compares them to results obtained in an operating building. RSSI-based localization algorithms were tested due to their relative low cost and potential for accuracy. Four different localization algorithms (MinMax, Maximum Likelihood, Ring Overlapping Circle RSSI and k-Nearest Neighbor) were eva...

In this letter, we present an improved hazard rate twisting technique for the estimation of the probability that a sum of independent but not necessarily identically distributed subexponential Random Variables (RVs) exceeds a given threshold. Instead of twisting all the components in the summation, we propose to twist only the RVs which have the biggest impact on the right-tail of the sum distr...

In this paper, we study an emergence of game strategy in multiagent systems. Symbolic and subsymbolic approaches are compared. Symbolic approach is represented by a backtrack algorithm with specified search depth, whereas the subsymbolic approach is represented by feedforward neural networks that are adapted by reinforcement temporal difference TD(lambda) technique. As a test game, we used simp...

Abstract Robust optimization is proving to be a fruitful tool study problems with uncertain data. In this paper we deal the minmax aproach robust multiobjective optimization. We survey main features of problem particular reference results concerning linear scalarization and sensitivity optimal values respect changes in uncertainty set. Furthermore prove solutions Finally apply presented mean-va...