Results 31 to 40 of about 4,819,979 (323)
IEEE Access, 2019 Pixel value differencing (PVD) and least significant bit substitution (LSB) are two widely used schemes in image steganography. These two methods do not consider different content in a cover image for hiding the secret data.
Mohamed Abdel Hameed +3 more
doaj +1 more source
Road manhole cover defect detection via multi-scale edge enhancement and feature aggregation pyramid. [PDF]
Sci RepLiu J +5 more
europepmc +3 more sources
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings [PDF]
, 2013 The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulkerson. In this paper we prove that deciding whether this number is at most
Esperet, Louis, Mazzuoccolo, Giuseppe
core +6 more sources
ZooKeys, 2015 We studied the distribution of millipedes in a forest interior-forest edge-grassland habitat complex in the Hajdúság Landscape Protection Area (NE Hungary).
Dávid Bogyó +3 more
doaj +1 more source
Reef fishes of Saba Bank, Netherlands Antilles : Assemblage structure across a gradient of habitat types [PDF]
, 2010 Saba Bank is a 2,200 km2 submerged carbonate platform in the northeastern Caribbean Sea off Saba Island, Netherlands Antilles. The presence of reef-like geomorphic features and significant shelf edge coral development on Saba Bank have led to the ...
Debrot, A.O. +3 more
core +7 more sources
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover [PDF]
, 2002 Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier.
Dinur, Irit +3 more
core +4 more sources
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Algorithms, 2018 We define a general model of stochastically-evolving graphs, namely the edge-uniform stochastically-evolving graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete
Ioannis Lamprou +2 more
doaj +1 more source
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
, 2012 A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy +10 more
core +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Spectral information and backscatter information are both exclusively important bases for land cover classification, and these two kinds of information are found in multispectral images and SAR images, respectively. Therefore, the fusion of complementary
Xunqiang Gong +5 more
doaj +1 more source
Shorter tours and longer detours: Uniform covers and a bit beyond [PDF]
, 2019 Motivated by the well known four-thirds conjecture for the traveling salesman problem (TSP), we study the problem of {\em uniform covers}. A graph $G=(V,E)$ has an $\alpha$-uniform cover for TSP (2EC, respectively) if the everywhere $\alpha$ vector (i.e.
Haddadan, Arash +2 more
core +3 more sources