Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Michal Rolinek"'
Publikováno v:
Computer Vision – ECCV 2020
Lecture Notes in Computer Science
Computer Vision – ECCV 2020 ISBN: 9783030586034
ECCV (28)
Lecture Notes in Computer Science
Computer Vision – ECCV 2020 ISBN: 9783030586034
ECCV (28)
Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers. Using the presence of heavily opt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2b67bea14ea3946cad1d887d3f4479c
http://arxiv.org/abs/2003.11657
http://arxiv.org/abs/2003.11657
Publikováno v:
(2015). 2015 IEEE 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015) : Berkeley, California, USA, 17-20 October 2015 ; proceedings. Piscataway, NJ: IEEE, pp. 1246-1258
FOCS
FOCS
An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::866fd60eb10dc2df3b1b6d0c214be0c0
https://doi.org/10.1137/16m1091836
https://doi.org/10.1137/16m1091836
Publikováno v:
CVPR
Rank-based metrics are some of the most widely used criteria for performance evaluation of computer vision models. Despite years of effort, direct optimization for these metrics remains a challenge due to their non-differentiable and non-decomposable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49b40ed90113ba4a578f0b3179e0810b
Publikováno v:
CVPR
The Variational Autoencoder (VAE) is a powerful architecture capable of representation learning and generative modeling. When it comes to learning interpretable (disentangled) representations, VAE and its variants show unparalleled performance. Howev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8dab4151027f1cd0513b016e220ba5a
http://arxiv.org/abs/1812.06775
http://arxiv.org/abs/1812.06775
Autor:
Georg Osang, Michal Rolinek, Karen Klein, Chethan Kamath, Krzysztof Pietrzak, Joël Alwen, Peter Gazi, Leonid Reyzin, Michal Rybár
Publikováno v:
AsiaCCS
We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly lower
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c44663c9fef5062de5d92a35f35c6d91
https://doi.org/10.1145/3196494.3196534
https://doi.org/10.1145/3196494.3196534
Publikováno v:
CVPR
The accuracy of information retrieval systems is often measured using complex loss functions such as the average precision (AP) or the normalized discounted cumulative gain (NDCG). Given a set of positive and negative samples, the parameters of a ret
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dc1c835b8d2ca82723498aa04350eaf
https://ora.ox.ac.uk/objects/uuid:3546e42b-6780-4afb-91a3-06163f95aed5
https://ora.ox.ac.uk/objects/uuid:3546e42b-6780-4afb-91a3-06163f95aed5
The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::643a1a7b551917b235a8cc47c9447362
http://arxiv.org/abs/1602.03124
http://arxiv.org/abs/1602.03124
Publikováno v:
SIAM Journal on Imaging Sciences
We consider the problem of minimizing the continuous valued total variation subject to different unary terms on trees and propose fast direct algorithms based on dynamic programming to solve these problems. We treat both the convex and the non-convex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4be08537f46aed3219d00149ae4da53
http://arxiv.org/abs/1502.07770
http://arxiv.org/abs/1502.07770
Publikováno v:
Algorithms and Computation ISBN: 9783662489703
ISAAC
ISAAC
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism \({\mathbf {R}\rightarrow \varvec{\Gamma }}\) between two relational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f876ffe73ce00adad6ffc1ddb45be5a0
https://doi.org/10.1007/978-3-662-48971-0_48
https://doi.org/10.1007/978-3-662-48971-0_48