( en | de | ru )

 

Disambiguation of "Moseley, Benjamin"

Author of the publication

copydeleteadd this publication to your clipboard
An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means.

, and . AAAI, page 6307-6314. AAAI Press, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ralph Moseley

Christopher Moseley

Benjamin Köckemann

Abundance, niche breadth and stress in the centre and at the border of the distribution range: a macroecological study on abundant and rare tree specie. Uni Göttingen, (2008)

Benjamin Bender

Cerebrospinal fluid and interstitial fluid volume measurement in the human brain at 3T with EPI. Uni Tübingen, (2009)

Benjamin Braatz

Formal modelling and application of graph transformations in the resource description framework. TU Berlin, (2009)
 

Other publications of authors with the same name

On Coresets for Regularized Loss Minimization., , , , and . CoRR, (2019)New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract)., , , , , , , and . WAOA, volume 6534 of Lecture Notes in Computer Science, page 71-82. Springer, (2010)Filtering: a method for solving graph problems in MapReduce., , , and . SPAA, page 85-94. ACM, (2011)Efficient Nonmyopic Active Search., , , , , and . ICML, volume 70 of Proceedings of Machine Learning Research, page 1714-1723. PMLR, (2017)Scheduling jobs with varying parallelizability to reduce variance., , , , and . SPAA, page 11-20. ACM, (2010)Online Scheduling with General Cost Functions., , and . SIAM J. Comput., 43 (1): 126-143 (2014)Cooperative Set Function Optimization Without Communication or Coordination., , , , , and . AAMAS, page 1109-1118. ACM, (2017)Fast clustering using MapReduce., , and . KDD, page 681-689. ACM, (2011)A Scalable Approximation Algorithm for Weighted Longest Common Subsequence., , , and . Euro-Par, volume 12820 of Lecture Notes in Computer Science, page 368-384. Springer, (2021)Minimizing Completion Times for Stochastic Jobs via Batched Free Times., , and . SODA, page 1905-1930. SIAM, (2023)