This proposal adds a function template (std::minmax) and / or an algorithm (std::minmax_element) to the header , both of which are implicitly present (by two separate calls to std::min and std::max, or std::min_element and std::max_element), but admit a better implementation if the two calls are combined into one. Both additions can be considered independently, although they are stro...

In this paper, we study an optimal location query based on a road network. Specifically, given a road network containing clients and servers, an optimal location query is to find a location on the road network such that when a new server is set up at this location, a certain cost function computed based on the clients and servers (including the new server) is optimized. Two types of cost functi...

We develop a model of multi-candidate electoral competition in a multi-dimensional policy space with strategic voters. We show that when the distribution of voter ideal points is log-concave, there exist pure-strategy subgame perfect equilibria in weakly undominated strategies in which platforms are located in the minmax set. Analytical and numerical results suggest that the size of the minmax ...

Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectives, MinMax, Balanced, MinSum-MinMin, and MinSum-MinMax. We use the algorithm by Perl-Shiloach and labelling and scaling techniques to devise an FPTAS for the first three objectives. For the forth one, we propose a gen...

In 1991, Edelsbrunner and Tan gave an O(n) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NPcomplete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the ...

Autocorrelation functions are a major tool for the understanding of single-cell firing patterns. Short-term peaks in autocorrelation functions have previously been interpreted as a tendency towards bursting activity or elevated probability to emit spikes in a short time-scale. These peaks can actually be a result of the firing of a neuron with a refractory period followed by a period of constan...

HUGO is the content-based adaptive steganography method for spatial images which can approximately preserve the joint statistic of differences between up to four neighboring pixels in four different directions. But the steganalysis method based on the higher order local model can fail HUGO. In view of the above problem, an improved steganography is proposed. Firstly, by analyzing the higher ord...

Mining operations can produce highly localized, low intensity earthquakes that are referred to as microseismic events. Monitoring of microseismic events is useful in predicting and comprehending hazards, and in evaluating the overall performance of a mine design. A robust localization algorithm is used to estimate the source position of the microseismic event by selecting the hypothesized sourc...

Recurrence relations with minimization and maximization, called minmax recurrence relations are commonly encountered in the analysis of algorithms. In this paper we present the solution of one such challenging recurrence relation. We characterize the optimal partition sizes as well as derive the order of complexity of the overall recurrence relation. It is proved that ad hoc equal partitioning ...