In this paper, we propose a fast and optimal solution for block motion estimation based on an adaptive multilevel successive elimination algorithm. This algorithm is accomplished b...
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
Alexandros Nanopoulos, Apostolos N. Papadopoulos, ...
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
We study statistical consistency of two recently proposed subspace identification algorithms for closed-loop systems. These algorithms een as implementations of an abstract state-...
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...