Results 61 to 70 of about 2,959 (186)
Land Degradation &Development, EarlyView.ABSTRACT The use of Land Use Land Cover (LULC) analysis is a fundamental requirement for urban solid waste management (SWM); however, conventional LULC analysis methods are not well suited to the spatio‐temporal variability, multi‐sensor heterogeneity, and seasonal variations of highly dynamic urban environments.
Rubeena Vohra, Ashish Kumar
wiley +1 more source
Decomposing hypergraphs into k-colorable hypergraphs
Transactions on Combinatorics, 2014 For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the hypergraph induced by $E_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(H) rceil$.
Omidi, Gholamreza, Tajbakhsh, Khosro
openaire +2 more sources
Semisupervised Hypergraph Discriminant Learning for Dimensionality Reduction of Hyperspectral Image
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Semisupervised learning is an effective technique to represent the intrinsic features of a hyperspectral image (HSI), which can reduce the cost to obtain the labeled information of samples.
Fulin Luo +4 more
doaj +1 more source
Networks, EarlyView.ABSTRACT In this work, we introduce and study the p$$ p $$‐α$$ \alpha $$‐closest‐center problem (pα$$ p\alpha $$CCP), which is a generalization of the p$$ p $$‐second‐center problem, a recently emerged variant of the classical (discrete) p‐center problem.
Elisabeth Gaar +2 more
wiley +1 more source
Multi-grained hypergraph interest modeling for conversational recommendation
AI Open, 2023 Conversational recommender system (CRS) interacts with users through multi-turn dialogues in natural language, which aims to provide high-quality recommendations for user’s instant information need.
Chenzhan Shang +4 more
doaj +1 more source
An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem
Networks, EarlyView.ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu +3 more
wiley +1 more source
Weak hypergraph regularity and linear hypergraphs
Journal of Combinatorial Theory, Series B, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshiharu Kohayakawa +3 more
openaire +2 more sources
2023 62nd IEEE Conference on Decision and Control (CDC), 2023 In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in many real-world networks.
Joshua Pickard +3 more
openaire +2 more sources
On $\alpha$-spectral theory of a directed k-uniform hypergraph [PDF]
Computer Science Journal of Moldova, 2020 In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha
Gholam-Hasan Shirdel +2 more
doaj
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT As an attestation engagement, auditing is required to provide reasonable assurance for its conclusions. Traditional auditing has limited capacity to handle unstructured data and is usually based on audit sampling techniques, which can lead to the neglect of important audit evidence during the auditing process and result in a higher audit risk,
Xiaojia Wang, Ziqing Luo, Chaoxu Mu
wiley +1 more source