Probabilistic Submodular Maximization in Sub-Linear Time.

Research article (International Conference on Machine Learning, 2017) · cited 21× · AI/ML
Press Enter · cited answer in seconds

Probabilistic Submodular Maximization in Sub-Linear Time.

Summary

Probabilistic Submodular Maximization in Sub-Linear Time. is a scholarly article[1].

Key Facts

  • Probabilistic Submodular Maximization in Sub-Linear Time.'s instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Probabilistic Submodular Maximization in Sub-Linear Time.. Retrieved May 24, 2026, from https://4ort.xyz/entity/probabilistic-submodular-maximization-in-sub-linear-time
MLA “Probabilistic Submodular Maximization in Sub-Linear Time..” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/probabilistic-submodular-maximization-in-sub-linear-time.
BibTeX @misc{4ortxyz_probabilistic-submodular-maximization-in-sub-linear-time_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Probabilistic Submodular Maximization in Sub-Linear Time.}}, year = {2026}, url = {https://4ort.xyz/entity/probabilistic-submodular-maximization-in-sub-linear-time}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Probabilistic Submodular Maximization in Sub-Linear Time. — https://4ort.xyz/entity/probabilistic-submodular-maximization-in-sub-linear-time (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/probabilistic-submodular-maximization-in-sub-linear-time · Last refreshed: