83,354 Hits in 5.6 sec

Vertex Coloring of Comparability+ke and –ke Graphs [chapter]

Yasuhiko Takenaga, Kenichi Higashide
2006 Lecture Notes in Computer Science  
The chromatic number of $G$ , denoted as $\chi(G)$ , is the smallest $t$ for which $G$ is tcolorable.  ...  Then vertex coloring problem is defined as follows. VERTEX COLORING Input : A graph $G=(V, E)$ and a positive integer $t\leq|V|$ . Question: Is $G$ t-colorable?  ... 
doi:10.1007/11917496_10 fatcat:v47o3dnnr5ft3kt7icrg5jg2tq

Conflict-Free Coloring of Graphs

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer
2018 SIAM Journal on Discrete Mathematics  
For the bicriteria problem of minimizing the number of colored vertices subject to a given bound \chi CF (G) \leq k with k \in \{ 1, 2\} , we prove that the problem is NP-hard for planar and polynomially  ...  C e1 C e2 C e3 C e4 C e5 C e6 T 2 T 3 T 4 T 5 T 6 D f (b) The neighborhood configuration graph of f and the cycle in the neighborhood configuration graph corresponding to the neighborhood configuration  ... 
doi:10.1137/17m1146579 fatcat:uj3b7rzgsbgb3io4j7njd2i6dy

3D hierarchical optimization for multi-view depth map coding

Marc Maceira Duch, David Varas, Josep Ramon Morros Rubió, Javier Ruiz-Hidalgo, Ferran Marques
2017 Multimedia tools and applications  
Depth data has a widespread use since the popularity of high-resolution 3D sensors. In multi-view sequences, depth information is used to supplement the color data of each view.  ...  Color and depth images of each view are segmented independently and combined in an optimal Rate-Distortion fashion.  ...  Acknowledgements This work has been developed in the framework of projects TEC2013-43935-R and TEC2016-75976-R, financed by the Spanish Ministerio de Economía y Competitividad and the European Regional  ... 
doi:10.1007/s11042-017-5409-z fatcat:aoq4zla5enb4pgp7nybohc5bei

A Note on Embedding Hypertrees

Po-Shen Loh
2009 Electronic Journal of Combinatorics  
In this note, we completely solve their problem, proving the tight result that $\chi > t$ is sufficient to embed any $r$-tree with $t$ edges.  ...  Bohman, Frieze, and Mubayi proved that $\chi > 2rt$ is sufficient to embed every $r$-tree with $t$ edges, and asked whether the dependence on $r$ was necessary.  ...  The author thanks his Ph.D. advisor, Benny Sudakov, for introducing him to this problem, and for remarks that helped to improve the exposition of this note.  ... 
doi:10.37236/256 fatcat:5yzhe76tofgxrdbwe2irucux4u

Compulsivity is measurable across distinct psychiatric symptom domains and is associated with familial risk and reward-related attentional capture

Lucy Albertella, Samuel R. Chamberlain, Mike E. Le Pelley, Lisa-Marie Greenwood, Rico S.C. Lee, Lauren Den Ouden, Rebecca A. Segrave, Jon E. Grant, Murat Yücel
2019 CNS Spectrums  
and sixty individuals participated in the study (mean age = 36.0 [SD = 10.8] years; 60.0% male) and completed the Cambridge-Chicago Compulsivity Trait Scale (CHI-T), along with measures of psychiatric  ...  findings suggest that the CHI-T is suitable for use in online studies and constitutes a transdiagnostic marker for a range of compulsive symptoms, their familial loading, and related cognitive markers  ...  The color of this color-singleton circle-referred to as the distractor-related directly to the size of the reward available on the current trial: one color (the high-reward color) signaled that a large  ... 
doi:10.1017/s1092852919001330 pmid:31645228 fatcat:cq4ukz3iq5bvjlgythzj6nvl5q

Page 245 of Journal of Personality Vol. 28, Issue 2 [page]

1960 Journal of Personality  
*® Toothpick Construction® Subtraction problems*® Percentage correct Number correct Stroop Word Color Interference Test Reading color names Card Sorting* Naming color hues Base rate Interference score  ...  The hypotheses concerning the relationships of the ipsative scores of the various criterion tasks to cognitive styles were tested by means of chi-square analyses.  ... 

Intercrossing Among Pink Calla, White-Spotted Calla, and Yellow Calla.Ryohitsu Shibuya , G. T. Neichi

Wang Chi-Wu
1957 The Quarterly review of biology  
The variation in color intensity suggests the presence of suppressors for the anthocyanin coloration (Chapter V).  ...  None of the more usual topics is slighted. A very useful statistical appendix contains a treatment of the Chi-Square Method, Confidence Limits for the Binomial Distribution, and Measurement Data.  ... 
doi:10.1086/401893 fatcat:mkcpbpx4hjbublrfwe2e4fvjua

Session-Based Recommender System for Sustainable Digital Marketing

Hyunwoo Hwangbo, Yangsok Kim
2019 Sustainability  
In addition, it is notable that FWSBRs overcome the cold-start item problem, one significant limitation of CFR and ISBR, without losing performance.  ...  Our experimental results show that FWSBR with chi-square feature weighting scheme outperforms ISBR, ASBRs, and Collaborative Filtering Recommender (CFR).  ...  item t and item t+1 with the number of sessions from item t .  ... 
doi:10.3390/su11123336 fatcat:wt2mmb7razb55cqwuiwe54alxi

Comparative study of histogram distance measures for re-identification [article]

Pedro A. Marín-Reyes, Javier Lorenzo-Navarro, Modesto Castrillón-Santana
2016 arXiv   pre-print
A measure ranking is generated to calculate the area under the CMC, this area is the indicator used to evaluate which distance measure and color space present the best performance for the considered databases  ...  In this paper we study the behavior of several histogram distance measures in different color spaces.  ...  As shown in equation (1) , the task of re-identificacion is formally defined, as follows: T = argmin Ti D(T i , Q), T i ∈ τ (1) where D() is a similarity measure, that matches the probe Q with the n candidates  ... 
arXiv:1611.08134v1 fatcat:r55rvikbwvho3i53zfcgfdi2qu

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

V. Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
2013 Algorithmica  
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2 O(b) N O(1) , where the parameter b is the maximum size of the color classes of the given  ...  We also describe fpt algorithms for certain permutation group problems that are used as subroutines in our algorithm. √ n log n , where n is the size of the vertex set of the graph, does not yield a similar  ...  Discussion We now briefly address the complexity of the canonization problem associated with CHI. We first recall the definition of canonization. Let K denote the set of all instances of CHI.  ... 
doi:10.1007/s00453-013-9787-y fatcat:xeafq7bdy5cpzdug3xj76serne

Page 389 of The Journal of Speech and Hearing Disorders Vol. 17, Issue 4 [page]

1952 The Journal of Speech and Hearing Disorders  
Therefore four chi-squares were computed for each of the 40 variables, or 40 chi-squares for each of the four criteria of suc- cess. A total of 160 chi-squares was computed.  ...  Factor S, social introversion, was significant at the 1% level, while Factor T, think- ing introversion, and Factor R, happy- go-luckiness, were significant at the 9% level.  ... 

Treatment contrasts in paired comparisons: Basic procedures with application to factorials

1976 Biometrika  
The general estimation problem is to find estimators pi of n. i u 1, ... , or p of r, maximizing L(i_) in (I.3) subject to the constraints, i t) -2,1÷4l (2.1) incorporating (1.6).  ...  freedom as its limiting distribution under H When 0' m w 0 and n = (t -1), the original chi-square test with (t -1) degrees of freedom for treatment equality is obtained.  ...  Results are summarized in an analysis of chi square table very analogous to the typical analysis of variance summary.  ... 
doi:10.1093/biomet/63.2.255 fatcat:kogv55pyajabbcf4fmuh5yqi2y

Treatment Contrasts in Paired Comparisons: Basic Procedures with Application to Factorials

Ralph A. Bradley, Abdalla T. El-Helbawy
1976 Biometrika  
The general estimation problem is to find estimators pi of n. i u 1, ... , or p of r, maximizing L(i_) in (I.3) subject to the constraints, i t) -2,1÷4l (2.1) incorporating (1.6).  ...  freedom as its limiting distribution under H When 0' m w 0 and n = (t -1), the original chi-square test with (t -1) degrees of freedom for treatment equality is obtained.  ...  Results are summarized in an analysis of chi square table very analogous to the typical analysis of variance summary.  ... 
doi:10.2307/2335617 fatcat:bxglaa4xefb4fnauojs2q4hfna

Page 236 of Journal of Cognitive Neuroscience Vol. 12, Issue 2 [page]

2000 Journal of Cognitive Neuroscience  
Tel.: 919-684-6122: | t , t > Wepartmer of Neurobiology, x 4209 Viedical Center 119-68 il. e . ner. duke ed t-4431; e-mail: purves@ REFERENCES Appel, K., & Haken, W. ( oof of 4-color theorem  ...  of color space (Figure 3C) Of course, the specific colors we experience as pri mary could have been otherwise, but if our argument with respect to the four-color-map problem is correct, the challenge  ... 

Page 36 of The Science Teacher Vol. 11, Issue 2 [page]

1944 The Science Teacher  
Y. 36 THE SCIENCE TEACHER CHI Continu to mi At th to ob woul with | From cotto!  ...  ies a plete of th 250 s ilar | facto ploys sixty A G and the « knov the I seer one in th to ¢ have T rapl own Plar able chin to t HI n wor nect tive Hai the ext und ver rec I dus sch gar AP  ... 
« Previous Showing results 1 — 15 out of 83,354 results