Results 51 to 60 of about 418 (155)
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
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
Hypergraph limits: a regularity approach
Random Struct. Algorithms, 2013 A sequence of $k$-uniform hypergraphs $H_1, H_2, \dots$ is convergent if the sequence of homomorphism densities $t(F, H_1), t(F, H_2), \dots$ converges for every $k$-uniform hypergraph $F$. For graphs, Lovász and Szegedy showed that every convergent sequence has a limit in the form of a symmetric measurable function $W \colon [0,1]^2 \to [0,1]$.
openaire +3 more sources
Random matchings in linear hypergraphs
Forum of Mathematics, SigmaFor a given hypergraph H and a vertex v∈V(H) $v\in V(H)$ v element of upper V left parenthesis upper H right parenthesis , consider a random matching M chosen uniformly from the set of all matchings in H. $H.$ upper H period In 1995, $1995,$
Hyunwoo Lee
doaj +1 more source
An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem
Networks, Volume 88, Issue 2, Page 250-274, September 2026.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
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
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Cognitive diagnosis aims to infer learners' knowledge states from their exercise responses, enabling personalised education at scale. Existing methods represent exercises solely by coarse‐grained knowledge component annotations, overlooking semantic content and step‐level cognitive processes.
Youheng Bai +4 more
wiley +1 more source
Applications of the regularity lemma for uniform hypergraphs [PDF]
Random Structures & Algorithms, 2005 AbstractIn this article we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on the recent results of Nagle, Schacht, and the authors, we give here solutions to these problems.In particular, we prove the following: Let ℱ be a k‐uniform hypergraph on t vertices and suppose an n‐vertex k‐uniform ...
Vojtech Rödl, Jozef Skokan
openaire +1 more source
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source