نتایج جستجو برای: graph based

تعداد نتایج: 3070292  

Journal: :Transactions of the Japanese Society for Artificial Intelligence 2001

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

Learning the underlying distribution of molecular graphs and generating high-fidelity samples is a fundamental research problem in drug discovery material science. However, accurately modeling rapidly novel remain crucial challenging goals. To accomplish these goals, we propose Conditional Diffusion model based on discrete Graph Structures (CDGS) for graph generation. Specifically, construct fo...

Journal: :Journal of Artificial Intelligence Research 2005

Visual saliency is a cognitive psychology concept that makes some stimuli of a scene stand out relative to their neighbors and attract our attention. Computing visual saliency is a topic of recent interest. Here, we propose a graph-based method for saliency detection, which contains three stages: pre-processing, initial saliency detection and final saliency detection. The initial saliency map i...

Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...

Journal: :iranian journal of mathematical chemistry 2015
a. heydari

let g be a connected simple (molecular) graph. the distance d(u, v) between two vertices u and v of g is equal to the length of a shortest path that connects u and v. in this paper we compute some distance based topological indices of h-phenylenic nanotorus. at first we obtain an exactformula for the wiener index. as application we calculate the schultz index and modified schultz index of this ...

Journal: :journal of algorithms and computation 0
stephen j. gismondi department of mathematics & statistics, university of guelph, guelph, on, ca. n1g 2w1

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

Journal: :Engineering Applications of Artificial Intelligence 2022

The importance of considering related stocks data for the prediction stock price movement has been shown in many studies; however, advanced graphical techniques modeling, embedding and analyzing behavior inter-related have not widely exploited movements yet. main challenges this domain are to find a way modeling existing relations among an arbitrary set exploit such model improving performance ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید