Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Marek Cygan"'
Publikováno v:
IEEE Access, Vol 12, Pp 37744-37756 (2024)
We present Polite Teacher, a simple yet effective method for the task of semi-supervised instance segmentation. The proposed architecture relies on the Teacher-Student mutual learning framework. To filter out noisy pseudo-labels, we use confidence th
Externí odkaz:
https://doaj.org/article/ff98e480ba254c1a98e6cc80df0dc061
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 1, Iss Combinatorics (2013)
Combinatorics
Externí odkaz:
https://doaj.org/article/49930070b5d34c61a2d025987c2dc942
Publikováno v:
SIAM Journal on Computing. 48:417-450
In the classic Minimum Bisection problem we are given as input an undirected graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::722fbe66013f475806ec5a06cf1e796f
https://doi.org/10.1137/140988553
https://doi.org/10.1137/140988553
Publikováno v:
SIAM Journal on Computing. 51:STOC20-i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebf8dd59569045623cb6270e7b2475da
https://doi.org/10.1137/22n975494
https://doi.org/10.1137/22n975494
Autor:
Bundit Laekhanukit, Parinya Chalermsook, Marek Cygan, Danupon Nanongkai, Guy Kortsarz, Pasin Manurangsi, Luca Trevisan
Publikováno v:
SIAM Journal on Computing
We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable (FPT) algorithms....
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05bf70e7b18e48eafc591655e8a7b047
http://hdl.handle.net/11565/4033667
http://hdl.handle.net/11565/4033667
Publikováno v:
Discrete Applied Mathematics. 204:38-48
We consider a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A weighted sequence determines the probability for each symbol to occur at a given position of the sequence (such sequences are also called Posit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::768e153a9e4e35c8009a87a994ee37e1
https://doi.org/10.1016/j.dam.2015.11.011
https://doi.org/10.1016/j.dam.2015.11.011
Publikováno v:
Scopus-Elsevier
In the EDGE CLIQUE COVER (ECC) problem, given a graph G and an integer k, we ask whether the edges of G can be covered with k complete subgraphs of G or, equivalently, whether G admits an intersection model on k-element universe. Gramm et al. [JEA 20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01b80de98bb2727aec60b566fb4c6662
https://doi.org/10.1137/130947076
https://doi.org/10.1137/130947076
Publikováno v:
FOCS
We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. We apply our framework to obtain the first FPT algorithm for the Unique Label Cover problem and new FPT algorithms with exponentia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab773d825ff657c85ab943a91c0596e9
https://doi.org/10.1137/15m1032077
https://doi.org/10.1137/15m1032077
Publikováno v:
53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012
Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this article, we introduce a general framework for solving problems on such graphs using matrix multiplicatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87bbfaa5bd11f1a919dc2a4d5e318067
https://doi.org/10.1145/2736283
https://doi.org/10.1145/2736283
Publikováno v:
Theory of Computing Systems. 58:357-376
In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a clu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d816f130d8878f4096b0046930f338f5
https://doi.org/10.1007/s00224-015-9631-7
https://doi.org/10.1007/s00224-015-9631-7