We have 3 of 58 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A subgraph filter algebra based on distance-aware Laplacian constructions is developed, defining a structured and controllable class of filters for effective approximation and quantifying how well the learned operator approximates the restricted ambient mapping.
By modeling the graph structure as a distribution conditioned on signal realizations, this framework provides a principled approach to signal-dependent graph structures, which are common in real-world applications, while explicitly encoding uncertainty in graph topology.
Results show that although current models achieve strong semantic adherence and visual quality, they often fail to faithfully capture fine-grained cultural details, particularly for underrepresented regions, rituals, and multimodal cultural cues.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
