نتایج جستجو برای: balanced irregular vague graph

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

2014
Emanuele Carlini Patrizio Dazzi Andrea Esposito Alessandro Lulli Laura Ricci

A significant part of the data produced every day by online services is structured as a graph. Therefore, there is the need for efficient processing and analysis solutions for large scale graphs. Among the others, the balanced graph partitioning is a well known NP-complete problem with a wide range of applications. Several solutions have been proposed so far, however most of the existing state-...

Bazrafshan, Behnaz, Fazel, Abdolreza, Hashempour, Mohammad Reza, Jouybari, Leila, Rostami, Masoomeh, Sanagoo, Akram, Sarmadi, Payam, Shirangi, Seyed Payam,

Abstract Adrenal gland cysts are rare indications of adrenal diseases, which are commonly asymptomatic. In radiological studies, these cysts, known as incidentalomas, are often detected by coincidence accounting for 6% of the population. Adrenal incidentalomas are commonly detected, and autonomous cortisol hypersecretion is the most prevalent abnormality associated with these masses. Since thi...

2013
Sheng Li Yun Fu

Graph based semi-supervised learning (GSSL) plays an important role in machine learning systems. The most crucial step in GSSL is graph construction. Although several interesting graph construction methods have been proposed in recent years, how to construct an effective graph is still an open problem. In this paper, we develop a novel approach to constructing graph, which is based on low-rank ...

1996
Robert K. Gjertsen Mark T. Jones Paul E. Plassmann

The computation of good, balanced graph colorings is an essential part of many algorithms required in scientiic and engineering applications. Motivated by an eeective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under the PRAM computational model as the scalable coloring heuristic introduced by Jones and Plassmann (...

Journal: :CoRR 2012
Isabelle Stanton

There has been a recent explosion in the size of stored data, partially due to advances in storage technology, and partially due to the growing popularity of cloud-computing and the vast quantities of data generated. This motivates the need for streaming algorithms that can compute approximate solutions without full random access to all of the data. We model the problem of loading a graph onto ...

Journal: :ACM Transactions on Intelligent Systems and Technology 2022

It is essential to predict crowd flow precisely in a city, which practically partitioned into irregular regions based on road networks and functionality. However, prior works mainly focus grid-based prediction, where city divided many regular grids. Although Convolutional Neural Netwok (CNN) powerful capture spatial dependence from Euclidean data, it fails tackle non-Euclidean reflect the corre...

Journal: :IEEE Computer Architecture Letters 2022

Designing a graph processing system that can scale to sizes are orders of magnitude larger than what is possible on single accelerator requires careful codesign memory bandwidth and capacity, the interconnect between accelerators, overall architecture. We present high-level bottleneck-analysis model for design evaluation <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http:/...

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

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