An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...