We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
to appear in Proc. IEEE Int’l Conf. on Acoustics, Speech, and Signal Processing, March, 2008 High-dynamic-range medical images take intensity values which cannot be visualized o...
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...