Transmission of continuous media streams has been a challenging problem of multimedia service. Lots of works have been done trying to figure out the best solution for this problem, and some works presented the optimal solution for transmitting the stored video using smoothing schemes applied to each individual stream. But those smoothing schemes considered only one stream, not the whole streams...

The Earth Mover’s Distance (EMD) is a distance measure between distributions with applications in image retrieval and matching. We consider the problem of computing a transformation of one distribution which minimizes its EMD to another. The applications discussed here include estimation of the size at which a color pattern occurs in an image, lighting-invariant object recognition, and point fe...

This paper presents a genetic trajectory planning method of a robot manipulator producing the optimal trajectory between two end points. Genetic algorithm based methods seldom require a priori knowledge of a problem. Furthermore, they do not tend to fall into local optima and proceed toward the global optimum. However, they have di culty in handling equality constraints of trajectory boundary c...

Algorithms which guarantee to find globally optimal trajectories by covering a hypervolume of state space become infeasible in high dimensions. We have developed an algorithm which generates locally optimal trajectories without covering a hypervolume which only requires polynomial memory and time. Even though the algorithm does not guarantee a globally optimal trajectory in a deterministic mann...

We propose a derivative-free algorithm for finding high-quality local minima for functions that require significant computational resources to evaluate. Our algorithm efficiently utilizes the computational resources allocated to it and also has strong theoretical results, almost surely starting a finite number of local optimization runs and identifying all local minima. We propose metrics for m...

We consider the following singularly perturbed Neumann problem (Lin-Ni-Takagi problem) ε∆u− u+ u = 0 , u > 0 in Ω, ∂u ∂ν = 0 on ∂Ω, where p > 2 and Ω is a smooth and bounded domain in R2. We construct a new class of solutions which consist of large number of spikes concentrating on a segment of the boundary which contains a strict local minimum point of the mean curvature function and has the s...

An algorithm that uses the greedy method attempts to construct an optimal (compound) solution to a problem by optimally constructing components one by one. In general, building up locally optimal components may not yield a globally optimal overall solution, but a greedy algorithm will give an optimal result if these two coincide. There are two main issues that arise when applying the greedy app...

This work presents scale invariant region detectors that apply evolved operators to extract an interest measure. We evaluate operators using their repeatability rate, and have experimentally identified a plateau of local optima within a space of possible interest operators Ω. The space Ω contains operators constructed with Gaussian derivatives and standard arithmetic operations. From this set o...

The Internet protocol used today for global routing — the Border Gateway Protocol (BGP) — evolved in a rather organic manner without a clear theoretical foundation. This has stimulated a great deal of recent theoretical work in the networking community aimed at modeling BGP-like routing protocols. This paper attempts to make this work more accessible to a wider community by reformulating it in ...

Hoffmann’s topological analysis of the h and h F state spaces explained why Fast Forward dominated the performance on early planning domains (Hoffmann 2004). His taxonomy segmented domains according to the presence/size of local minima and dead-end class. Surprisingly, the taxonomy has not been used to explain the performance of other planners that use similar heuristics. In this paper, we exte...