We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Learning visual classifiers for object recognition from weakly labeled data requires determining correspondence between image regions and semantic object classes. Most approaches u...
Inparticle-tracing radiosityalgorithms, energy-carrying particles are traced through an environmentfor simulating global illumination. Illumination on a surface is reconstructed f...
We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved timepoints, clustering, and dataset alignment. Each expression p...
Ziv Bar-Joseph, Georg Gerber, David K. Gifford, To...