Search Results for author:
Found 2 papers, 1 papers with code
Efficient Event Stream Super-Resolution with Recursive Multi-Branch Fusion
FFM is designed for the fusion of contextual information within neighboring event streams, leveraging the coupling relationship between positive and negative events to alleviate the misleading of noises in the respective branches.
Quantum Algorithm for Online Convex Optimization
(ii) We show that for strongly convex loss functions, the quantum algorithm can achieve $O(\log T)$ regret with $O(1)$ queries as well, which means that the quantum algorithm can achieve the same regret bound as the classical algorithms in the full information setting.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
