We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
—This review article explores the notion of radio flexibility, its various versions (as presented in a brief taxonomy) and its efficient instantiations under various metrics, pri...
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
In this paper a new approach for face clustering is developed. Mutual information and joint entropy are exploited in order to create a metric for the clustering process. The way t...
Nicholas Vretos, Vassilios Solachidis, Ioannis Pit...