Template dependencies (TD’s) are a class of data dependencies that include multivalued and join dependencies and embedded versions of these. A collection of techniques, examples and results about TD’s are presented. The principal results are: 1) Finite implication (implication over relations with a finite number of tuples) is distinct from unrestricted implication for TD’s. 2) There are, for TD...

In many applications, the data, such as web pages and research papers, contain relation (link) structure among entities in addition to textual content information. Matrix factorization (MF) methods, such as latent semantic indexing (LSI), have been successfully used to map either content information or relation information into a lower-dimensional latent space for subsequent processing. However...

In many applications, the data, such as web pages and research papers, contain relation (link) structure among entities in addition to textual content information. Matrix factorization (MF) methods, such as latent semantic indexing (LSI), have been successfully used to map either content information or relation information into a lower-dimensional latent space for subsequent processing. However...

Let ⊲ be a relation between graphs. We say graph G is -ubiquitous if whenever Γ with n for all ∈ N , then one also has ℵ 0 where αG the disjoint union of α many copies . The Ubiquity Conjecture Andreae, well-known open problem in theory infinite graphs, asserts that every locally finite connected ubiquitous respect to minor relation. In this paper we show trees are topological relation, irrespe...