New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to ...
Anthony Gallagher, Terry L. Zimmerman, Stephen F. ...
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
The idea of integrating users into the design and production process is a promising strategy for companies being forced to react to the growing individualization of demand. The us...
Frank Thomas Piller, Petra Schubert, Michael Koch,...
In this project, we are developing new text processing tools that help people perform advanced analysis of large collections of text commentary. This problem is increasingly faced...
Stuart W. Shulman, Eduard H. Hovy, Jamie Callan, S...