5 citations · 9 across the 4 of their papers we have counts for
5 papers
Team Formation for Scheduling Educational Material in Massive Online Classes
Sanaz Bahargam, Dóra Erdos, Azer Bestavros +1
Whether teaching in a classroom or a Massive Online Open Course it is crucial to present the material in a way that benefits the audience as a whole. We identify two important task…
A Divide-and-Conquer Algorithm for Betweenness Centrality
Dora Erdos, Vatche Ishakian, Azer Bestavros +1
The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is a…
Scalable Boolean Tensor Factorizations using Random Walks
Dóra Erdős, Pauli Miettinen
Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary…
Sink-Stable Sets of Digraphs
Dóra Erdős, András Frank, Krisztián Kun
We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum cardinality of the union of k sink-stable sets. The results imply a recent min-…
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
Dóra Erdös, Vatche Ishakian, Andrei Lapets +2
In many information networks, data items -- such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route upda…