Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
— This paper presents a simple and generic indicator-based multi-objective local search. This algorithm is a direct extension of the IBEA algorithm, an indicatorbased evolutionar...