20,828 Research products, page 1 of 2,083
Loading
- Publication . Article . Preprint . Conference object . 2022Open Access EnglishAuthors:Yair Bartal; Ora Nova Fandina; Ofer Neiman;Yair Bartal; Ora Nova Fandina; Ofer Neiman;
A tree cover of a metric space (X,d) is a collection of trees, so that every pair x,y in X has a low distortion path in one of the trees. If it has the stronger property that every point x in X has a single tree with low distortion paths to all other points, we call thi...
add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022 . Embargo End Date: 01 Jan 2020Open AccessAuthors:Timothy C. Burness; Aner Shalev;Timothy C. Burness; Aner Shalev;Publisher: arXiv
Fix a positive integer $d$ and let $\Gamma_d$ be the class of finite groups without sections isomorphic to the alternating group $A_d$. The groups in $\Gamma_d$ were studied by Babai, Cameron and P\'{a}lfy in the 1980s and they determined bounds on the order of a primit...
Average popularityAverage popularity In bottom 99%Average influencePopularity: Citation-based measure reflecting the current impact.Average influence In bottom 99%Influence: Citation-based measure reflecting the total impact.add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022Open Access EnglishAuthors:Yael Mathov; Tal Ben Senior; Asaf Shabtai; Yuval Elovici;Yael Mathov; Tal Ben Senior; Asaf Shabtai; Yuval Elovici;
Mass surveillance systems for voice over IP (VoIP) conversations pose a great risk to privacy. These automated systems use learning models to analyze conversations, and calls that involve specific topics are routed to a human agent for further examination. In this study...
add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022Open AccessAuthors:Keller, Nathan; Klein, Ohad;Keller, Nathan; Klein, Ohad;Publisher: Elsevier BV
We prove the following conjecture, due to Tomaszewski (1986): Let $X= \sum_{i=1}^{n} a_{i} x_{i}$, where $\sum_i a_i^2=1$ and each $x_i$ is a uniformly random sign. Then $\Pr[|X|\leq 1] \geq 1/2$. Our main novel tools are local concentration inequalities and an improved...
add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022Open Access EnglishAuthors:Xi Wu; C.X. Zhang; M.A. Zubkov;Xi Wu; C.X. Zhang; M.A. Zubkov;
We propose the model of layered materials, in which each layer is described by the conventional Haldane model, while the inter - layer hopping parameter corresponds to the ABC stacking. We calculate the topological invariant $N_3$ for the resulting model, which is respo...
add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022Open Access EnglishAuthors:Chengshuai Wu; Michael Margaliot;Chengshuai Wu; Michael Margaliot;
A linear dynamical system is called $k$-positive if its dynamics maps the set of vectors with up to $k-1$ sign variations to itself. For $k=1$, this reduces to the important class of positive linear systems. Since stable positive linear time-invariant (LTI) systems alwa...
Average popularityAverage popularity In bottom 99%Average influencePopularity: Citation-based measure reflecting the current impact.Average influence In bottom 99%Influence: Citation-based measure reflecting the total impact.add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022 . Embargo End Date: 01 Jan 2021Open AccessAuthors:Robert Krauthgamer; Shay Sapir;Robert Krauthgamer; Shay Sapir;Publisher: arXiv
Large matrices are often accessed as a row-order stream. We consider the setting where rows are time-sensitive (i.e. they expire), which can be described by the sliding-window row-order model, and provide the first $(1+\epsilon)$-approximation of Schatten $p$-norms in t...
Average popularityAverage popularity In bottom 99%Average influencePopularity: Citation-based measure reflecting the current impact.Average influence In bottom 99%Influence: Citation-based measure reflecting the total impact.add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Preprint . Article . 2022 . Embargo End Date: 01 Jan 2019Open AccessAuthors:Eli Schwartz; Leonid Karlinsky; Rogerio Feris; Raja Giryes; Alex Bronstein;Eli Schwartz; Leonid Karlinsky; Rogerio Feris; Raja Giryes; Alex Bronstein;Publisher: arXiv
Learning from one or few visual examples is one of the key capabilities of humans since early infancy, but is still a significant challenge for modern AI systems. While considerable progress has been achieved in few-shot learning from a few image examples, much less att...
add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Preprint . Article . 2022 . Embargo End Date: 01 Jan 2021Open AccessAuthors:Roni Con; Itzhak Tamo;Roni Con; Itzhak Tamo;Publisher: arXivProject: EC | InfoNet (852953)
The problem of repairing linear codes and, in particular, Reed Solomon (RS) codes has attracted a lot of attention in recent years due to their extreme importance to distributed storage systems. In this problem, a failed code symbol (node) needs to be repaired by downlo...
Average popularityAverage popularity In bottom 99%Average influencePopularity: Citation-based measure reflecting the current impact.Average influence In bottom 99%Influence: Citation-based measure reflecting the total impact.add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product. - Publication . Article . Preprint . 2022Open AccessAuthors:Golubev, Konstantin; Kamber, Amitay;Golubev, Konstantin; Kamber, Amitay;Publisher: Elsevier BVCountry: SwitzerlandProject: EC | HIEXP (692854)
It was recently shown by Lubetzky and Peres (2016) and by Sardari (2018) that Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the simple random walk in an optimal time and have an optimal almost-diameter. We show that this spectral condition ...
Average popularityAverage popularity In bottom 99%Average influencePopularity: Citation-based measure reflecting the current impact.Average influence In bottom 99%Influence: Citation-based measure reflecting the total impact.add Add to ORCIDPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.