The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
1 Electronic mail has become the most widely used business productivity application. However, people increasingly feel frustrated by their email. They are overwhelmed by the volum...
Steven L. Rohall, Dan Gruen, Paul Moody, Martin Wa...
The GE NLTooLsET is a set of text interpretation tools designed to be easily adapted to new domains. This report summarizes the system and its performance on the MUG-4 task . INTR...
George B. Krupka, Paul S. Jacobs, Lisa F. Rau, Loi...
Background: Gene expression microarray experiments are expensive to conduct and guidelines for acceptable quality control at intermediate steps before and after the samples are hy...
Lesley Jones, Darlene R. Goldstein, Gareth P. Hugh...