Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Abstract. In this article we try to make different kinds of information cooperate in a characters recognition system addressing old Greek and Egyptians documents. We first use a ...