Results 21 to 30 of about 483,308 (237)
An Improved Dense CNN Architecture for Deepfake Image Detection
IEEE Access, 2023 Recent advancements in computer vision processing need potent tools to create realistic deepfakes. A generative adversarial network (GAN) can fake the captured media streams, such as images, audio, and video, and make them visually fit other environments.
Yogesh Patel +6 more
doaj +1 more source
Hyperparameter Optimization on Ensemble Regression Tree for Lip Coloring Simulation
Jurnal Teknik Informatika dan Sistem Informasi, 2022 Technology helps us in many activities and keeps growing, so it makes activities more efficient, time-saving, using fewer resources and also information and entertainment are accessible.
Andi Hakim Arif, Achmad Solichin
semanticscholar +1 more source
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, 2013 An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each ...
Czap Július, Tuza Zsolt
doaj +1 more source
Facial packing vertex-coloring of subdivided plane graphs
Discrete Applied Mathematics, 2019 A facial packing vertex-coloring of a plane graph G is a coloring of its vertices with colors 1 , … , k such that every facial path containing two vertices with the same color i has at least i + 2 vertices.
J. Czap +3 more
semanticscholar +1 more source
Facial Incidence Colorings of Embedded Multigraphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a cellular embedding of a multigraph in a 2-manifold. Two distinct edges e1, e2 ∈ E(G) are facially adjacent if they are consecutive on a facial walk of a face f ∈ F(G). An incidence of the multigraph G is a pair (v, e), where v ∈ V (G), e ∈ E(G)
Jendrol’ Stanislav +2 more
doaj +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
Dye-enhanced visualization of rat whiskers for behavioral studies
eLife, 2017 Visualization and tracking of the facial whiskers is required in an increasing number of rodent studies. Although many approaches have been employed, only high-speed videography has proven adequate for measuring whisker motion and deformation during ...
Jacopo Rigosa +7 more
doaj +1 more source
Intensifying construction with color lexemes in Brazilian Portuguese
Revista Linguística, 2020 This paper exposes the results of the research on the formal-functional configuration of the Xcolor of NS subschema of the Xcolor of Y intensifier construction (as in purple/green of anger or red of shame) in Brazilian Portuguese.
Nahendi Almeida Mota +1 more
doaj +1 more source
Implementing Health‐Related Quality of Life Assessment in Pediatric Oncology: A Feasibility Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background There is growing interest in embedding health‐related quality of life (HRQoL) assessment and patient‐reported outcome measures (PROMs) within clinical cancer care. This study evaluated the feasibility, acceptability, and usability of implementing an electronic PROM (ePROM) platform to measure HRQoL in children with cancer ...
Mikaela Doig +13 more
wiley +1 more source
Facial [r,s,t]-Colorings of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július +3 more
doaj +1 more source