4 papers
Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity
Praneeth Vepakomma, Yulia Kempner, Ramesh Raskar
Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for comb…
Cospanning characterizations of violator and co-violator spaces
Yulia Kempner, Vadim E. Levit
Given a finite set E and an operator sigma:2^{E}-->2^{E}, two subsets X,Y of the ground set E are cospanning if sigma(X)=sigma(Y) (Korte, Lovasz, Schrader; 1991). We investigate co…
Combinatorics of Distance Covariance: Inclusion-Minimal Maximizers of Quasi-Concave Set Functions for Diverse Variable Selection
Praneeth Vepakomma, Yulia Kempner
In this paper we show that the negative sample distance covariance function is a quasi-concave set function of samples of random variables that are not statistically independent. W…
Correspondence Between Two Antimatroid Algorithmic Characterizations
Yulia Kempner, Vadim E. Levit
The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great imp…