E-LIB Suche - Ergebnisse für: Saunderson, James

1

Efficient Computation of the Quantum Rate-Distortion Functi..:

He, Kerry ; Saunderson, James ; Fawzi, Hamza
http://arxiv.org/abs/2309.15919. , 2023

Link: http://arxiv.org/abs/230..

2

Compressive quantum waveform estimation:

Tritt, Alex ; Morris, Joshua ; Bounds, Christopher C...
http://arxiv.org/abs/2310.15630. , 2023

Link: http://arxiv.org/abs/231..

3

A Bregman Proximal Perspective on Classical and Quantum Bla..:

He, Kerry ; Saunderson, James ; Fawzi, Hamza
http://arxiv.org/abs/2306.04492. , 2023

Link: http://arxiv.org/abs/230..

4

An Inexact Frank-Wolfe Algorithm for Composite Convex Optim..:

Shinde, Nimita ; Narayanan, Vishnu ; Saunderson, James
http://arxiv.org/abs/2310.14482. , 2023

Link: http://arxiv.org/abs/231..

5

Spinsim: a GPU optimized python package for simulating spin..:

Tritt, Alex ; Morris, Joshua ; Hochstetter, Joel...
http://arxiv.org/abs/2204.05586. , 2022

Link: http://arxiv.org/abs/220..

6

Optimal self-concordant barriers for quantum relative entro..:

Fawzi, Hamza ; Saunderson, James
http://arxiv.org/abs/2205.04581. , 2022

Link: http://arxiv.org/abs/220..

7

Finite-State Semi-Markov Channels for Nanopore Sequencing:

McBain, Brendon ; Viterbo, Emanuele ; Saunderson, James
http://arxiv.org/abs/2205.04187. , 2022

Link: http://arxiv.org/abs/220..

8

Hyperbolicity cones are amenable:

Lourenço, Bruno F ; Roshchina, Vera ; Saunderson, James
http://arxiv.org/abs/2102.06359. , 2021

Link: http://arxiv.org/abs/210..

9

A convex form that is not a sum of squares:

Saunderson, James
http://arxiv.org/abs/2105.08432. , 2021

Link: http://arxiv.org/abs/210..

10

Memory-Efficient Approximation Algorithms for Max-k-Cut and..:

Shinde, Nimita ; Narayanan, Vishnu ; Saunderson, James
http://arxiv.org/abs/2110.00779. , 2021

Link: http://arxiv.org/abs/211..

11

Memory-efficient approximation algorithms for MAX-K-CUT and..:

Shinde, Nimita ; Narayanan, Vishnu ; Saunderson, James
Shinde , N , Narayanan , V & Saunderson , J 2021 , Memory-efficient approximation algorithms for MAX-K-CUT and correlation clustering . in M Ranzato , A Beygelzimer , Y Dauphin , P S Liang & J Wortman Vaughan (eds) , Advances in Neural Information Processing Systems 34 (NeurIPS 2021) . Neural Information Processing Systems (NIPS) , San Diego CA USA , Advances in Neural Information Processing Systems 2021 , Online , United States of America , 7/12/21 .. , 2021

Link: https://research.monash...

12

Amenable cones are particularly nice:

Lourenço, Bruno F ; Roshchina, Vera ; Saunderson, James
http://arxiv.org/abs/2011.07745. , 2020

Link: http://arxiv.org/abs/201..

13

Spectral Polyhedra:

Sanyal, Raman ; Saunderson, James
http://arxiv.org/abs/2001.04361. , 2020

Link: http://arxiv.org/abs/200..

14

Lifting for Simplicity: Concise Descriptions of Convex Sets:

Fawzi, Hamza ; Gouveia, João ; Parrilo, Pablo A..
http://arxiv.org/abs/2002.09788. , 2020

Link: http://arxiv.org/abs/200..

15

Terracini convexity:

Saunderson, James ; Chandrasekaran, Venkat
https://arxiv.org/abs/2010.00805. , 2020

Link: https://doi.org/10.1007/..