Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Database management systems comprise various algorithms for efficiently retrieving and managing data. Typically, algorithm efficiency or performance is correlated with execution s...
Efficient motion estimation is very important for compressing video in standards like MPEG1/2/4 and ITU-T H.261/263. In this paper a new algorithm will be presented which can outp...
Alexis M. Tourapis, Oscar C. Au, Ming L. Liou, Guo...
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...