This paper studies the problem of matching two unsynchronized video sequences of the same dynamic scene, recorded by different stationary uncalibrated video cameras. The matching i...
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
In this paper, we propose a novel method to reduce the magnitude of 4D CT artifacts by stitching two images with a data-driven regularization constrain, which helps preserve the l...
Dongfeng Han, John Bayouth, Qi Song, sudershan Bha...
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...