Results 51 to 60 of about 408,826 (276)
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem [PDF]
, 2016 An important theorem of Banaszczyk (Random Structures & Algorithms `98) states that for any sequence of vectors of $\ell_2$ norm at most $1/5$ and any convex body $K$ of Gaussian measure $1/2$ in $\mathbb{R}^n$, there exists a signed combination of these
Dadush, Daniel +3 more
core +2 more sources
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
, 2017 We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds.
Fischer, Manuela +2 more
core +1 more source
Power law violation of the area law in quantum spin chains [PDF]
, 2016 The sub-volume scaling of the entanglement entropy with the system's size, $n$, has been a subject of vigorous study in the last decade [1]. The area law provably holds for gapped one dimensional systems [2] and it was believed to be violated by at most ...
Affleck +5 more
core +2 more sources
ESTIMATING CROP COVER FRACTION FROM DIGITAL COLOR IMAGES [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017 Abstract. The use of automated methods to estimate crop cover fraction from digital color images has increased in recent years. Crop cover fraction can determine accurate, fast and inexpensive with this methods. A digital color images was acquired over each of the 30 sample fields in 2014 year at 2–3 week intervals.
Karakus P., Karabork H.
openaire +4 more sources
Random independent sets in triangle-free graphs
Forum of Mathematics, SigmaWe establish several new results on the existence of probability distributions on the independent sets in triangle-free graphs where each vertex is present with a given probability.
Anders Martinsson, Raphael Steiner
doaj +1 more source
Changing Bases: Multistage Optimization for Matroids and Matchings [PDF]
, 2014 This paper is motivated by the fact that many systems need to be maintained continually while the underlying costs change over time. The challenge is to continually maintain near-optimal solutions to the underlying optimization problems, without creating
A. Borodin +11 more
core +2 more sources
Color Processing System of Art Color Based on Fractional Differential Equation
Applied Mathematics and Nonlinear Sciences, 2023 Abstract This paper mainly studies a high-precision correction method for warp knitting seamless images. The color factor conversion method is used to transform the gray level of the center point in the frequency domain. Then this paper proposes an image-denoising method based on an average way to improve image quality.
Hongyu Wang, Long Cheng, Zheng Huang
openaire +1 more source
Local Graph Coloring and Index Coding
, 2013 We present a novel upper bound for the optimal index coding rate. Our bound uses a graph theoretic quantity called the local chromatic number. We show how a good local coloring can be used to create a good index code.
Dimakis, Alexandros G. +2 more
core +1 more source
FEBS Letters, EarlyView.In this study, we present the structure of AcrIE8.1, a previously uncharacterized anti‐CRISPR protein that inhibits the type I‐E CRISPR‐Cas system. Through a combination of structural and biochemical analyses, we demonstrate that AcrIE8.1 directly binds to the Cas11 subunit of the Cascade complex to inhibit the CRISPR‐Cas system.
Young Woo Kang, Hyun Ho Park
wiley +1 more source
Independent sets and cuts in large-girth regular graphs [PDF]
, 2016 We present a local algorithm producing an independent set of expected size $0.44533n$ on large-girth 3-regular graphs and $0.40407n$ on large-girth 4-regular graphs.
Csóka, Endre
core +1 more source