archive-lt.com » LT » T » THERAN.LT

Total: 41

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • Louis Theran
    2015 Justin Malestein Louis Theran The algebraic combinatorial approach for Low Rank Matrix Completion Journal of Machine Learning Research 2015 Franz J Király Louis Theran Ryota Tomioka Frameworks with forced symmetry II orientation preserving crystallographic groups Geometriae Dedicata 2014 Justin Malestein Louis Theran Generic combinatorial rigidity of periodic frameworks Advances in Mathematics 2013 Justin Malestein Louis Theran Topological designs Geometriae Dedicata 2013 Justin Malestein Igor Rivin Louis Theran Natural realizations of sparsity matroids Ars Mathematica Contemporanea 2011 Ileana Streinu Louis Theran Slider pinning rigidity a Maxwell Laman type theorem Discrete Computational Geometry 2010 Ileana Streinu Louis Theran Sparse hypergraphs and pebble game algorithms European Journal of Combinatorics 2009 Ileana Streinu Louis Theran Sparsity certifying graph decompositions Graphs and Combinatorics 2009 Ileana Streinu Louis Theran Characterizing sparse graphs by map decompositions Journal of Combinatorial Mathematics and Combinatorial Computing 2007 Ruth Haas Audrey Lee Ileana Streinu Louis Theran Graded sparse graphs and matroids Journal of Universal Computer Science 2007 Audrey Lee Ileana Streinu Louis Theran Refereed conferences Delaunay triangulations with disconnected realization spaces In Proc of SoCG 2014 Arnau Padrol Louis Theran Detecting dependencies in geometric constraint systems In Proc of ADG 2014 James Farre Helena Kleinschmidt Jessica Sidman Audrey Lee St John Stephanie Stark Louis Theran Generic rigidity with forced symmetry and sparse colored graphs In Proc of Fields Workshop on Rigidity and Symmetry 2014 Justin Malestein Louis Theran Error Minimizing Estimates and Universal Entry Wise Error Bounds for Low Rank Matrix Completion In Proc of NIPS 2013 Franz J Király Louis Theran Rigid components in fixed lattice and cone frameworks In Proc of CCCG 2011 Matthew Berardi Brent Heeringa Justin Malestein Louis Theran Searching in tree like partial orders In Proc of WADS 2011 Brent Heeringa Marius Cătălin Iordan Louis Theran The rigidity transition in random graphs In Proc of

    Original URL path: http://theran.lt/ (2016-04-26)
    Open archived version from archive


  • Louis Theran - Curriculum Vitae
    crystallographic groups Geometriae Dedicata 2014 Justin Malestein Louis Theran Generic combinatorial rigidity of periodic frameworks Advances in Mathematics 2013 Justin Malestein Louis Theran Topological designs Geometriae Dedicata 2013 Justin Malestein Igor Rivin Louis Theran Natural realizations of sparsity matroids Ars Mathematica Contemporanea 2011 Ileana Streinu Louis Theran Slider pinning rigidity a Maxwell Laman type theorem Discrete Computational Geometry 2010 Ileana Streinu Louis Theran Sparse hypergraphs and pebble game algorithms European Journal of Combinatorics 2009 Ileana Streinu Louis Theran Sparsity certifying graph decompositions Graphs and Combinatorics 2009 Ileana Streinu Louis Theran Characterizing sparse graphs by map decompositions Journal of Combinatorial Mathematics and Combinatorial Computing 2007 Ruth Haas Audrey Lee Ileana Streinu Louis Theran Graded sparse graphs and matroids Journal of Universal Computer Science 2007 Audrey Lee Ileana Streinu Louis Theran Refereed conferences Delaunay triangulations with disconnected realization spaces In Proc of SoCG 2014 Arnau Padrol Louis Theran Detecting dependencies in geometric constraint systems In Proc of ADG 2014 James Farre Helena Kleinschmidt Jessica Sidman Audrey Lee St John Stephanie Stark Louis Theran Generic rigidity with forced symmetry and sparse colored graphs In Proc of Fields Workshop on Rigidity and Symmetry 2014 Justin Malestein Louis Theran Error Minimizing Estimates and Universal Entry Wise Error Bounds for Low Rank Matrix Completion In Proc of NIPS 2013 Franz J Király Louis Theran Rigid components in fixed lattice and cone frameworks In Proc of CCCG 2011 Matthew Berardi Brent Heeringa Justin Malestein Louis Theran Searching in tree like partial orders In Proc of WADS 2011 Brent Heeringa Marius Cătălin Iordan Louis Theran The rigidity transition in random graphs In Proc of SODA 2011 Shiva Kasiviswanathan Cristopher Moore Louis Theran Rigid components of random graphs In Proc of CCCG 2009 Louis Theran Combinatorial genericitity and minimal rigidity In Proc of SoCG 2008 Ileana Streinu Louis Theran Analyzing rigidity with pebble games In Proc of SoCG 2008 Audrey Lee Ileana Streinu Louis Theran The slider pinning problem In Proc of CCCG 2007 Audrey Lee Ileana Streinu Louis Theran Finding and maintaining rigid components In Proc of CCCG 2005 Audrey Lee Ileana Streinu Louis Theran Preprints Algebraic combinatorial methods for low rank matrix completion with application to athletic performance prediction Preprint 2014 Duncan Blythe Louis Theran Franz J Király Learning with Cross Kernels and Ideal PCA Preprint 2014 Franz J Király Martin Kreuzer Louis Theran Ultrarigid periodic frameworks Preprint 2014 Justin Malestein Louis Theran Matroid regression Preprint 2014 Franz J Király Louis Theran Dual to kernel learning with ideals Preprint 2014 Franz J Király Martin Kreuzer Louis Theran Algebraic matroids with graph symmetry Preprint 2013 Franz J Király Zvi Rosen Louis Theran Coherence and sufficient sampling densities for reconstruction in compressed sensing Preprint 2013 Franz J Király Louis Theran Generic rigidity of reflection frameworks Preprint 2012 Justin Malestein Louis Theran Henneberg constructions and covers of cone Laman graphs Preprint 2012 Louis Theran Lines induced by bichromatic point sets Preprint 2011 Louis Theran Generic rigidity of frameworks with orientation preserving crystallographic symmetry Preprint 2011 Justin Malestein Louis Theran Teaching

    Original URL path: http://theran.lt/CV/ (2016-04-26)
    Open archived version from archive

  • Research and academic profile
    structure in data with matroids and other combinatorial objects The algebraic geometry of kernel methods from a generative point of view Academic positions 6 2014 5 2017 Aalto Science Fellow Cofunded by AKA project COALESCE PI Petteri Kaski 9 2011 6 2014 Post doc in the Discrete Geometry Group at Freie Universität Berlin Supported by the ERC Advance Grant Project SDModels of Günter Ziegler 7 2009 8 2011 Research Assistant

    Original URL path: http://theran.lt/bio/ (2016-04-26)
    Open archived version from archive

  • Contact information
    theran aalto fi phone 358 50 4615336 skype louis theran whatsapp 49 157 37643686 threema KRUU6RSB Visiting ICS T B354 Mailing Address Louis Theran Aalto Science Institute PO Box 15500

    Original URL path: http://theran.lt/contact/ (2016-04-26)
    Open archived version from archive

  • Index of coauthors
    Karim A Adiprasito Matthew Berardi Duncan Blythe James Farre Ruth Haas Brent Heeringa Marius Cătălin Iordan Shiva Kasiviswanathan Franz J Király Helena Kleinschmidt Martin Kreuzer Audrey Lee St John Audrey Lee Justin Malestein Cristopher Moore Anthony Nixon Arnau Padrol Igor

    Original URL path: http://theran.lt/coauthors/ (2016-04-26)
    Open archived version from archive

  • Anchored boundary conditions for locally isostatic networks
    network can be rendered effectively isostatic We refer to these as anchored boundary conditions An important example is formed by a two dimensional network of corner sharing triangles which is the focus of this paper Another way of rendering such networks isostatic is by adding an external wire along which all unpinned vertices can slide sliding boundary conditions This approach also allows for the incorporation of boundaries associated with internal

    Original URL path: http://theran.lt/papers/j013-triangles.html (2016-04-26)
    Open archived version from archive

  • Universality theorems for inscribed polytopes and Delaunay triangulations
    to the set of inscribed realizations up to Möbius transformation of a polytope If the semialgebraic set is moreover open then in addition we prove that up to homotopy it is a retract of the realization space of some inscribed neighborly and simplicial polytope We also show that all algebraic extensions of are needed to coordinatize inscribed polytopes These statements show that inscribed polytopes exhibit the Mnëv universality phenomenon Via

    Original URL path: http://theran.lt/papers/j012-inscribed.html (2016-04-26)
    Open archived version from archive

  • Frameworks with forced symmetry I: reflections and rotations
    We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection To establish these results we develop a new technique for deriving

    Original URL path: http://theran.lt/papers/j011-rr.html (2016-04-26)
    Open archived version from archive