Discovery of graphical models is NP-hard in general, which justifies using heuristics. We consider four commonly used heuristics. We summarize the underlying assumptions and anal...
The current methods used to mine and analyze temporal social network data make two assumptions: all edges have the same strength, and all parameters are time-homogeneous. We show ...
We have analyzed system rankings for person name search algorithms using a data set for which several versions of ground truth were developed by employing different means of resol...
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...