e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
Anwar Al Hamra, Ernst W. Biersack, Guillaume Urvoy...