marketing – PhD Seminars

Tag: marketing

Applied Mathematics, Computation and Simulation: Part I

Applied Mathematics, Computation and Simulation: Part I

Upcoming Seminars

Archives

Calendar

2:00 pm: PhD Seminars 06-12-2021

Talk 1

Speaker

Tareq Si Salem (NEO)

Title

AÇAI: Ascent Similarity Caching with Approximate Indexes

Posts tagged "marketing"

admin 2016/11/22 2017/03/21Seminars

During last Monday’s seminar, which was the first of the Applied Mathematics chapter, we discovered a lot of things on Mesh adaptations and Fluid Dynamics, thanks to a really wonderful presentation by Eleanore Gauci of team ECUADOR. If you would like to find out more about this work, Eleanore suggests…

Search for:
Upcoming Seminars
- 2:00 pm – 3:30 pm, December 6, 2021 – PhD Seminars 06-12-2021
Subjects of interest
applied mathematics asteroid exploration biological systems brain combinatorial optimization communication conductivity estimation dynamic dynamics EEG fixed point loops fluid dynamics functional emmbeddings fusion plasmas Galerkin time domain methods git health-biology infection spread invariant manifolds mapping marketing mesh modeling nanophotonics networks networks-systems-distributed-computing neuronal cells numerical simulations optimal transport optimisation optimization pattern recognition PDE protein function radar applications regularization retina routing applications scientific dissemination sed shape matching source localization stochastic gradient algorithm variability workshop
Archives

6 2:00 pm: PhD Seminars 06-12-2021 December 6, 2021 2:00 pm – 3:30 pm Talk 1 Speaker Tareq Si Salem (NEO) Title AÇAI: Ascent Similarity Caching with Approximate Indexes Abstract Similarity search is of paramount importance in multimedia retrieval systems and recommender systems, augmented reality, and future machine learning applications. When these systems require to serve large objects for delay-sensitive demands, edge servers close to the end-user can operate as similarity caches to speed up the retrieval. The paper "AÇAI: Ascent Similarity Caching with Approximate Indexes" proposes a new similarity caching policy which improves on the state of the art by using (1) a fast indexing mechanism to query a large catalog of 1 billion objects in less than 1ms, and (2) an online mirror ascent scheme to optimally cache objects even in the presence of adversarial queries. More