3 citations · 9 across the 13 of their papers we have counts for
14 papers
CompanyName2Vec: Company Entity Matching Based on Job Ads
Ran Ziv, Ilan Gronau, Michael Fire
Entity Matching is an essential part of all real-world systems that take in structured and unstructured data coming from different sources. Typically no common key is available for…
Fair representation in the intersection of two matroids
Ron Aharoni, Eli Berger, Dani Kotlar +1
For a simplicial complex denote by the minimal number of edges from needed to cover the ground set. If is a matroid t…
Fair representation by independent sets
Ron Aharoni, Noga Alon, Eli Berger +4
For a hypergraph let denote the minimal number of edges from covering . An edge of is said to represent {\em fairly} (resp. {\em almost fairly}) a part…
Degree conditions for matchability in -partite hypergraphs
Ron Aharoni, Eli Berger, Dani Kotlar +1
We study conjectures relating degree conditions in -partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particul…
On a conjecture of Stein
Ron Aharoni, Eli Berger, Dani Kotlar +1
Stein proposed the following conjecture: if the edge set of is partitioned into sets, each of size , then there is a partial rainbow matching of size . He pro…
Representation of large matchings in bipartite graphs
Ron Aharoni, Dani Kotlar, Ran Ziv
Let be the smallest number such that every collection of matchings, each of size at least , in a bipartite graph, has a full rainbow matching. Generalizing famous…