Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Jaroslaw Blasiok"'
Publikováno v:
Discrete Analysis (2023)
An Improved Lower Bound for Sparse Reconstruction from Subsampled Walsh Matrices, Discrete Analysis 2023:3, 9 pp. There are many situations, often of great practical importance, where one would like to obtain a good approximation for a mathematical
Externí odkaz:
https://doaj.org/article/ed3a1d34edd149fbb7bd3e11afe485cc
Publikováno v:
Journal of Combinatorial Theory, Series B
Journal of Combinatorial Theory, Series B, Elsevier, 2018, 〈10.1016/j.jctb.2018.05.005〉
8th European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal of Combinatorial Theory, Series B, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2018, 〈10.1016/j.jctb.2018.05.005〉
8th European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal of Combinatorial Theory, Series B, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
A graph $H$ is an induced minor of a graph $G$ if it can be obtained from an induced subgraph of $G$ by contracting edges. Otherwise, $G$ is said to be $H$-induced minor-free. Robin Thomas showed that $K_4$-induced minor-free graphs are well-quasi-or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75f5c90c6933dd79a3690c21c5231f8d
https://doi.org/10.1016/j.jctb.2018.05.005
https://doi.org/10.1016/j.jctb.2018.05.005
Autor:
Kasper Green Larsen, Jaroslaw Blasiok, Michael Mitzenmacher, Preetum Nakkiran, Ben Lawson, Charalampos E. Tsourakakis, Vasileios Nakos
Publikováno v:
Internet Mathematics.
Social networks involve both positive and negative relationships, which can be captured in signed graphs. The {\em edge sign prediction problem} aims to predict whether an interaction between a pair of nodes will be positive or negative. We provide t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72ce64f16ed8038793f857cf8e38af30
https://doi.org/10.24166/im.05.2019
https://doi.org/10.24166/im.05.2019
Publikováno v:
FOCS
We give a short argument that yields a new lower bound on the number of subsampled rows from a bounded, orthonormal matrix necessary to form a matrix with the restricted isometry property. We show that a matrix formed by uniformly subsampling rows of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cca51d88f86e1bbc50bb310c8f0aa13
https://doi.org/10.1109/focs.2019.00091
https://doi.org/10.1109/focs.2019.00091
Publikováno v:
STOC
Arikan's exciting discovery of polar codes has provided an altogether new way to efficiently achieve Shannon capacity. Given a (constant-sized) invertible matrix $M$, a family of polar codes can be associated with this matrix and its ability to appro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abc8b85f0fb6e6a57233a620b984f94e
https://doi.org/10.1145/3188745.3188816
https://doi.org/10.1145/3188745.3188816
Autor:
Jaroslaw Blasiok
The distinct elements problem is one of the fundamental problems in streaming algorithms --- given a stream of integers in the range $\{1,\ldots,n\}$, we wish to provide a $(1+\varepsilon)$ approximation to the number of distinct elements in the inpu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5aa93ebc2640f910ddce25602e80338d
Publikováno v:
ICDM
Many important applications, including signal reconstruction, parameter estimation, and signal processing in a compressed domain, rely on a low-dimensional representation of the dataset that preserves {\em all} pairwise distances between the data poi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50dff0e6abc1dfb979dfbcb195ed9f55
http://arxiv.org/abs/1609.05388
http://arxiv.org/abs/1609.05388
Publikováno v:
STOC
We characterize the streaming space complexity of every symmetric norm $l$ (a norm on $\mathbb{R}^n$ invariant under sign-flips and coordinate-permutations), by relating this space complexity to the measure-concentration characteristics of $l$. Speci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fbec4acd60a9098f808227c05dd59c1
http://arxiv.org/abs/1511.01111
http://arxiv.org/abs/1511.01111
Autor:
Marcin Kamiński, Jaroslaw Blasiok
Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C_Q in Q with the property that f restricted to C_Q is an isomor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0900e97846812515c61dbedd93a6ea25
http://arxiv.org/abs/1304.5849
http://arxiv.org/abs/1304.5849
Autor:
Jaroslaw Blasiok, Marcin Kamiński
Publikováno v:
Parameterized and Exact Computation ISBN: 9783319038971
IPEC
IPEC
Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C Q in Q with the property that f restricted to C Q is an isomor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a76ef58669ce41744c0842faeba7bfe
https://doi.org/10.1007/978-3-319-03898-8_8
https://doi.org/10.1007/978-3-319-03898-8_8