( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast Eigen Matching.

, , , , и . BMVC, BMVA Press, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Yuichi Fujimori

Takuro Yoshida

Daisuke Yoshida

Shingo Yoshida

Kazuhiko Yoshida

 

Другие публикации лиц с тем же именем

Snapshot Multispectral Image Completion Via Self-Dictionary Transformed Tensor Nuclear Norm Minimization With Total Variation., , , , , и . ICIP, стр. 364-368. IEEE, (2021)Linear-Time FPT Algorithms via Network Flow., , и . SODA, стр. 1749-1761. SIAM, (2014)Non-convex Compressed Sensing with the Sum-of-Squares Method., и . SODA, стр. 570-579. SIAM, (2016)Average Sensitivity of Dynamic Programming., и . SODA, стр. 1925-1961. SIAM, (2022)Analysis for palatalized articulation of s sounds using synthetic speech., , , и . EUROSPEECH, стр. 1725-1728. ISCA, (1995)Fitting Low-Rank Tensors in Constant Time., и . NIPS, стр. 2473-2481. (2017)Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network., , , , и . ICML, том 202 из Proceedings of Machine Learning Research, стр. 17041-17060. PMLR, (2023)Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model., , , и . CoRR, (2020)A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity., и . ICALP, том 107 из LIPIcs, стр. 99:1-99:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs., , и . ICNC, стр. 407-413. IEEE Computer Society, (2012)