The notions of ultrametric distances and cyclic valuations appear when the set of values of the distance map is a cyclically ordered set. These structures can be described as subsp...
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these mo...
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...