268 citations · 470 across the 19 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 1 cited
Tight Bound of Incremental Cover Trees for Dynamic Diversification
Hannah Marienwald, Wikor Pronobis, Klaus-Robert Müller +1
Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important task in recommender systems, web search, database…
cs.DS2017★ 2 cited
Partial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs
Alexander Bauer, Shinichi Nakajima, Nico Görnitz +1
Markov random fields (MRFs) are a powerful tool for modelling statistical dependencies for a set of random variables using a graphical representation. An important computational pr…