BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Actuation of Elastic Tensegrity Knots
DTSTART:20240624T100000
DTEND:20240624T120000
DTSTAMP:20260916T021143Z
UID:4f625a3db3bb1ed8f969b94f2d898c852bb25e15fa4d427006ced21c
CATEGORIES:Conferences - Seminars
DESCRIPTION:Liliane-Joy Dandy\nEDIC candidacy exam\nExam president: Prof. 
 Wenzel Jakob\nThesis advisor: Prof. Mark Pauly\nCo-examiner: Prof. Josie H
 ughes\n\nAbstract\nSource Coding (or Compression) is one of the most funda
 mental problems in Information Theory. When the distribution of the source
  alphabet is known\, Huffman coding achieves the entropy of the source alp
 habet (for finite alphabets) which is the fundamental limit. However\, in 
 most of the real life scenarios\, the source alphabet is not known. In thi
 s case\, it is not possible to have zero redundancy in one-shot. However\,
  there are several Universal Compression algorithms for which the redundan
 cy diminishes in the asymptotical case. In this work\, I studied the backg
 round of Universal Compression along with the more recent Universal Coding
  techniques for any alphabet\, including infinite and even unknown alphabe
 ts\, that achieves diminishing redundancy. Moreover\, I examined the perfo
 rmance analysis of some approaches that are specific to the large\, possib
 ly infinite\, source alphabets.\n\nBackground papers\n\n[1] Nico Pietroni\
 , Marco Tarini\, Amir Vaxman\, Daniele Panozzo\, and Paolo Cignoni. 2017. 
 Position-based tensegrity design. ACM Trans. Graph. 36\, 6\, Article 172 (
 December 2017)\, 14 pages.\nURL : https://dl.acm.org/doi/10.1145/3130800.3
 130809\n\n[2] Michele Vidulis\, Yingying Ren\, Julian Panetta\, Eitan Grin
 spun\, and Mark Pauly. 2023. Computational Exploration of Multistable Elas
 tic Knots. ACM Trans. Graph. 42\, 4\, Article 73 (August 2023)\, 16 pages.
 \nURL : https://dl.acm.org/doi/abs/10.1145/3592399\n\n[3] J. Bern\, P. Ban
 zet\, R. Poranne and S. Coros. 2019. Trajectory optimization for cable-dri
 ven soft robot locomotion\, Proc. Robot. Sci. Syst. (Jun. 2019 ) \nURL : 
 https://www.roboticsproceedings.org/rss15/p52.pdf\n 
LOCATION:BC 233 https://plan.epfl.ch/?room==BC%20233
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR