We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...