1
0
0
(1 - 17 von 31
)
On the Equivalence of Automatic and Symbolic DifferentiationarXiv
arxiv.org
von S Laue · · Zitiert von: 7 — From: Soeren Laue [view email] [v1] Fri, 5 Apr :05:55 UTC (191 KB) [v2] Fri, 3 May :01:19 UTC (191 KB) [v3] Mon, 20 Jul von S Laue · · Zitiert von: 7 — From: Soeren Laue [view email] [v1] Fri, 5 Apr :05:55 UTC (191 KB) [v2] Fri, 3 May :01:19 UTC (191 KB) [v3] Mon, 20 Jul
A comparison of models of word meaning in contextACL Anthology
aclanthology.org
von G Dinu · · Zitiert von: 23 — Sören Laue. Friedrich-Schiller Universität. Jena, Germany . Abstract. This paper compares a number of recently pro- posed ... von G Dinu · · Zitiert von: 23 — Sören Laue. Friedrich-Schiller Universität. Jena, Germany . Abstract. This paper compares a number of recently pro- posed ...
A Simple and Efficient Tensor CalculusMatrixCalculus
www.matrixcalculus.org
von S Laue · · Zitiert von: 43 — Sören Laue,1,2 Matthias Mitterreiter,1 Joachim Giesen Friedrich ... Sören Laue has been funded by Deutsche Forschungsgemein- schaft (DFG) under ... von S Laue · · Zitiert von: 43 — Sören Laue,1,2 Matthias Mitterreiter,1 Joachim Giesen Friedrich ... Sören Laue has been funded by Deutsche Forschungsgemein- schaft (DFG) under ...
Combining ADMM and the Augmented Lagrangian Method ...IJCAI
www.ijcai.org
von J Giesen · Zitiert von: 18 — Joachim Giesen1 and Sören Laue∗1,2. 1Friedrich-Schiller-Universität Jena ... [Giesen and Laue, 2016] Joachim Giesen and Sören Laue. Distributed convex ... von J Giesen · Zitiert von: 18 — Joachim Giesen1 and Sören Laue∗1,2. 1Friedrich-Schiller-Universität Jena ... [Giesen and Laue, 2016] Joachim Giesen and Sören Laue. Distributed convex ...
Approximating k-hop minimum spanning trees in Euclidean ...ScienceDirect.com
www.sciencedirect.com
von S Laue · · Zitiert von: 12 — ... in Euclidean metrics. Author links open overlay panel. Sören Laue , Domagoj Matijević. Show more. Add to Mendeley. Share. Cite. https://doi.org von S Laue · · Zitiert von: 12 — ... in Euclidean metrics. Author links open overlay panel. Sören Laue , Domagoj Matijević. Show more. Add to Mendeley. Share. Cite. https://doi.org
Approximating k-hop minimum spanning trees in Euclidean metricswww.sciencedirect.com › science › article › pii › pdf
www.sciencedirect.com
von S Laue · · Zitiert von: 12 — Sören Laue, Domagoj Matijevic. ∗. Max-Planck-Institut für Informatik, Saarbrücken, Germany. Received 20 July 2007; received in revised form ...
Personal Routes with High-Dimensional Costs and ...Universität Konstanz
kops.uni-konstanz.de
von S Funke · · Zitiert von: 16 — Stefan Funke, Sören Laue, and Sabine Storandt; licensed under Creative Commons License CC-BY. 16th International Symposium on Experimental Algorithms (SEA ... › bitstream
Approximating Parameterized Convex Optimization ProblemsSpringer
link.springer.com
von J Giesen · · Zitiert von: 51 — Friedrich-Schiller-Universität Jena, Germany. Joachim Giesen & Sören Laue · ETH Zürich, Switzerland. Martin Jaggi. von J Giesen · · Zitiert von: 51 — Friedrich-Schiller-Universität Jena, Germany. Joachim Giesen & Sören Laue · ETH Zürich, Switzerland. Martin Jaggi.
Optimizing over the Growing SpectrahedronSpringer
link.springer.com
von J Giesen · · Zitiert von: 13 — Sören Laue. Part of the book series: Lecture Notes in Computer Science ... Joachim Giesen & Sören Laue. CMAP, École Polytechnique, Palaiseau, France. von J Giesen · · Zitiert von: 13 — Sören Laue. Part of the book series: Lecture Notes in Computer Science ... Joachim Giesen & Sören Laue. CMAP, École Polytechnique, Palaiseau, France.
A Faster Algorithm for Two-Variable Integer ProgrammingSpringer
link.springer.com
von F Eisenbrand · · Zitiert von: 4 — Friedrich Eisenbrand and Sören Laue. Max-Planck-Institut für InformatikSaarbrücken,. Germany .de.
Minimum-Energy Broadcast with Few Senders | SpringerLink
link.springer.com
von S Funke · · Zitiert von: 4 — Stefan Funke,; Sören Laue &; Rouven Naujoks. Conference paper Accesses. 1 Citations. Part of the Lecture Notes in Computer Science book series (LNCCN ... › chapter
A Hybrid Algorithm for Convex Semidefinite OptimizationICML 2024
icml.cc
von S Laue · · Zitiert von: 66 — Sören Laue . Friedrich-Schiller-University Jena, Germany. Abstract. We present a hybrid algorithm for optimiz- ing a convex, smooth ... von S Laue · · Zitiert von: 66 — Sören Laue . Friedrich-Schiller-University Jena, Germany. Abstract. We present a hybrid algorithm for optimiz- ing a convex, smooth ...
Metric multidimensional scaling for large single-cell ...National Institutes of Health (NIH) (.gov)
pubmed.ncbi.nlm.nih.gov
von S Canzar · · Zitiert von: 3 — Authors. Stefan Canzar , Van Hoan Do , Slobodan Jelić , Sören Laue , Domagoj Matijević , Tomislav Prusina. Affiliations. 1 Faculty ... von S Canzar · · Zitiert von: 3 — Authors. Stefan Canzar , Van Hoan Do , Slobodan Jelić , Sören Laue , Domagoj Matijević , Tomislav Prusina. Affiliations. 1 Faculty ...
Efficient Embedding of Scale-Free Graphs in the ...IEEE Computer Society
www.computer.org
von T Blasius · · Zitiert von: 67 — Thomas Bläsius, Tobias Friedrich , Anton Krohmer , and Sören Laue. Abstract—Hyperbolic geometry appears to be intrinsic in many large real networks. › trans › download-article › pdf
Geometric Set Cover and Hitting Sets for Polytopes in $R^3
hal.archives-ouvertes.fr
von S Laue · · Zitiert von: 23 — Sören Laue. Geometric Set Cover and Hitting Sets for Polytopes in R3. STACS 2008, Feb 2008, Bordeaux, France. pp ⟨hal ⟩ ... › ha...
GENO - Optimization for Classical Machine Learning Made ...AAAI
ojs.aaai.org
von S Laue · · Zitiert von: 1 — Sören Laue,1,2 Matthias Mitterreiter,1 Joachim Giesen1. 1Friedrich-Schiller-Universität Jena. Faculty of Mathematics and Computer Science. › AAAI › article › view
Regularization Paths with Guarantees for Convex ...mlr.press
proceedings.mlr.press
von J Giesen · · Zitiert von: 16 — Joachim Giesen, Martin Jaggi, Soeren Laue. Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, PMLR 22: , ... › gies...
Alle Infos zum Namen "Sören Laue"
sortiert nach Relevanz / Datum