forked from academicpages/academicpages.github.io
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Update 2009-10-01-paper-title-number-1.md
Signed-off-by: Gözde Özcan <[email protected]>
- Loading branch information
1 parent
f688d22
commit fc51ee9
Showing
1 changed file
with
9 additions
and
10 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,13 +1,12 @@ | ||
--- | ||
title: "Paper Title Number 1" | ||
collection: publications | ||
permalink: /publication/2009-10-01-paper-title-number-1 | ||
excerpt: 'This paper is about the number 1. The number 2 is left for future work.' | ||
date: 2009-10-01 | ||
venue: 'Journal 1' | ||
slidesurl: 'http://academicpages.github.io/files/slides1.pdf' | ||
paperurl: 'http://academicpages.github.io/files/paper1.pdf' | ||
citation: 'Your Name, You. (2009). "Paper Title Number 1." <i>Journal 1</i>. 1(1).' | ||
title: "Submodular Maximization via Taylor Series Approximation" | ||
collection: publications | ||
permalink: /publication/sub-max-via-taylor | ||
excerpt: 'We study submodular maximization problems with matroid constraints, in particular, problems where the objective can be expressed via compositions of analytic and multilinear functions. We show that for functions of this form, the so-called continuous greedy algorithm attains a ratio arbitrarily close to (1 − 1/e) ≈ 0.63 using a deterministic estimation via Taylor series approximation. This drastically reduces execution time over prior art that uses sampling.' | ||
date: 2021 | ||
venue: '2021 SIAM International Conference on Data Mining (SDM)' | ||
paperurl: 'http://gozde-ozcan.github.io/files/SubmodularMaximizationViaTaylorSeriesApproximation.pdf' | ||
citation: 'Özcan, Gözde, Armin Moharrer, and Stratis Ioannidis.(2021). "Submodular Maximization via Taylor Series Approximation." <i>Proceedings of the 2021 SIAM International Conference on Data Mining (SDM). Society for Industrial and Applied Mathematics, 2021.</i>.' | ||
--- | ||
|
||
The contents above will be part of a list of publications, if the user clicks the link for the publication than the contents of section will be rendered as a full page, allowing you to provide more information about the paper for the reader. When publications are displayed as a single page, the contents of the above "citation" field will automatically be included below this section in a smaller font. | ||
The contents above will be part of a list of publications, if the user clicks the link for the publication than the contents of section will be rendered as a full page, allowing you to provide more information about the paper for the reader. When publications are displayed as a single page, the contents of the above "citation" field will automatically be included below this section in a smaller font. |