搜索结果: 1-15 共查到“coloring”相关记录24条 . 查询时间(0.07 秒)
New natural blue food coloring from red cabbage（图）
New natural blue food coloring red cabbage
2021/4/16
A natural brilliant blue food coloring has been discovered by an international team of researchers including chemists at the University of California, Davis. Natural food colorings are in demand,...
A Subexponential Construction of Graph Coloring for Multiparty Computation
cryptographic protocols Multiparty Computations
2016/1/26
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal...
Multiple Target Counting and Tracking using Binary Proximity Sensors: Bounds, Coloring, and Filter
Multiple Target Counting Tracking using Binary Proximity Sensors Bounds Coloring Filter
2016/1/22
Binary proximity sensors (BPS) provide extremely low cost and privacy preserving features for tracking mobile targets in smart environment, but great challenges are posed for track-ing multiple target...
COMPARISON OF PHOTOCONSISTENCY MEASURES USED IN VOXEL COLORING
photoconsistency voxel coloring three-dimensional object modeling
2015/8/14
A framework for the comparison of photoconsistency measures used in voxel coloring algorithm is described. With this framework,
the results obtained in generalized voxel coloring algorithm using cert...
Coloring the Animated World:Exploring Human Color Perception and Preference through the Animated Film
Animated World Exploring Human Color Perception Preference through Animated Film
2015/8/13
Animated films present a unique set of challenges and questions to scholars examining films from a cognitive perspective. When the confines of the real world don’t exist as they do in live action film...
UNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS
Limit theorem the monochromatic edge evenly random colors random graph
2015/7/7
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. The limit theorems are universal depending solely on the limiting behavior ...
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
2012/6/29
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-co...
We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1$ colored.
Coloring, location and domination of corona graphs
Coloring domination location Roman domination corona graphs
2012/4/18
A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also a...
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such tha...
In multi-hop radio networks, such as wireless ad-hoc and sensor networks, nodes employ a MAC (Medium Access Control) protocol such as TDMA to coordinate accesses to the shared medium and to avoid inte...
Edge-coloring series-parallel multigraphs
Edge-coloring series-parallel multigraphs Data Structures and Algorithms Combinatorics
2011/10/9
Abstract: We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colore...
The condensation transition in random hypergraph 2-coloring
random structures phase transitions hypergraph 2-coloring second moment method
2011/9/5
Abstract: For many random constraint satisfaction problems such as random satisfiability or random graph or hypergraph coloring, the best current estimates of the threshold for the existence of soluti...
$k$-Conflict-Free Coloring and $k$-Strong-Conflict-Free Coloring for One Class of Hypergraphs and Online $k$-Conflict-Free Coloring
Hypergraphs Online $k$-Conflict-Free Coloring Combinatorics
2011/8/22
Abstract: Conflict-free coloring is a kind of coloring of hypergraphs requiring each hyperedge to have a color which appears only once. More generally, there are $k$-conflict-free coloring ($k$-CF-col...
Edge Coloring of Triangle-Free 1-Planar Graphs.