◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniel R. Schmidt

University Bonn

9 papers hereh-index 10345 citations43 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author8

Across the 9 of 9 papers where every author was matched, so the position is known.

fields
  • cs.DS4
  • astro-ph.IM2
  • cs.DM1
  • nucl-ex1
  • physics.ins-det1
affiliations
  • University Bonn
Homepage
same name
  • Daniel R. Schmidt — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152026
most citedThe 511-CAM Mission: A Pointed 511 keV Gamma-Ray Telescope with a Focal Plane Detector Made of Stacked Transition Edge Sensor Microcalorimeter Arrays

7 citations · 12 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2026

Exact ratio preservation via outliers for fair k-center clustering

Anna Arutyunova, Irina Fast, Annika Hennes +3

We study the k-center clustering problem under demographic fairness constraints, where the point set is partitioned into groups, and the aim is to compute clusters that exhibit a…

cs.DS2018

On the cost of essentially fair clusterings

Ioana O. Bercea, Martin Groß, Samir Khuller +4

Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this proc…

cs.DS2017★ 2 cited

A Local-Search Algorithm for Steiner Forest

Martin Groß, Anupam Gupta, Amit Kumar +4

In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connec…

cs.DS2015★ 1 cited

Solving k-means on High-dimensional Big Data

Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt

In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the k-means pro…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.