iTrans.ir
سفارش ترجمه
خانه
راهنما
چگونه سفارش ترجمه دهیم
تماس با ما
ترجمه فوری
راهنمای استفاده از سایت
API
بیشتر...
پرسش و پاسخ
قیمت ترجمه
ثبت نام
ورود
021-66989400
021-66989500
0935-173-0404
نشانی و اطلاعات تماس
تگ graph
جزئیات خدمات ترجمه در ترجمه تخصصی
query
web
RDF
graph
RDF
node
attack
ON THE ASSOCIATED GRAPHS TO A COMMUTATIVE RING
ON THE ASSOCIATED GRAPHS TO A COMMUTATIVE RING
Graph Databases
Graph Databases
CHAPTER 5
CHAPTER 1
CHAPTER 5
CHAPTER 1
CHAPTER 1
CHAPTER 1
CHAPTER 1
Graph databases
CHAPTER 1
PART1-29000
PART2-29000
PART3-29000
C
C
On Complexity of Isoperimetric Problems on Trees
On Complexity of Isoperimetric Problems on Trees
On Complexity of Isoperimetric Problems on Trees
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 28, NO. 3, MARCH 2006 469
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 28, NO. 3, MARCH 2006 469
On Dominator Colorings in Graphs
A Modern Treatment of the 15 Puzzle
"No really easy proof seems to be known." This article intends to
Available online at www.sciencedirect.com
KnowlInfSyst(2010)22:245–259
Available online at www.sciencedirect.com
ICIAfS'12 1569626783
Robust Shaping Indirect Field Oriented Control for Induction Motor 63
Robust Shaping Indirect Field Oriented Control for Induction Motor 63
Modeling and Fault Diagnosis of an Electrohydraulic Actuator
Computers & Operations Research 40 (2013) 385–394
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 5, NO. 5, MAY 1994
The lines are drawn through the three graph points for
The lines are drawn through the three graph points for
Algorithms for searching virtual spaces are used in constraint satisfaction
�R
2012 Second International Conference on Cloud and Green Computing
This paper proposed a Visual Exploratory Search Engine solution based
2012 Second International Conference on Cloud and Green Computing
2012 Second International Conference on Cloud and Green Computing
This paper proposed a Visual Exploratory Search Engine solution based
This paper proposed a Visual Exploratory Search Engine solution based
This paper proposed a Visual Exploratory Search Engine solution based
IEEETRANSACTIONSONPOWERSYSTEMS,VOL.28,NO.1,FEBRUARY2013 75
Identification of Software Instabilities
1: function Parallelize(Node n, int maxTasks)
Although the ultimate goal of research in Cyber Situational Awareness
Face recognition demonstrates the significant progress in the research field
Clinical Neurophysiology xxx (2012) xxx–xxx
ANF: A Fast and Scalable Tool for Data Mining
Graph Database Design Challenges using HPC Platforms Graph Database Design
have recently gained popularity in the database research community due
have recently gained popularity in the database research community due
have recently gained popularity in the database research community due
have recently gained popularity in the database research community due
Clinical Neurophysiology xxx (2012) xxx–xxx
Chapter 16
Mizan:OptimizingGraphMininginLargeParallelSystems
GRAMI: Frequent Subgraph and Pattern Mining in a Single
Complete and incomplete approaches for graph
214 Applications and Examples
Accepted Manuscript
E s t i m a t i o n o f D i s t r i b u t i o n A l g o r i t h m u s i n g F a c t o r G r a p h
Master’s thesis
CROSS-LAYER SCHEDULING IN CLOUD COMPUTING
Multi-Objective Ant Colony Optimization
Solving Pursuit-Evasion Problems on Height Maps
Code Composer
Solving Pursuit-Evasion Problems on Height Maps
Advanced Review
5
ISSN: 2278 – 1323
Journal of Combinatorial Theory, Series B 110 (2015) 47–66
6 Computing PageRank The computation of PageRank is fairly straightforward
JID:YJCSS AID:2905 /FLA [m3G; v1.159; Prn:14/07/2015; 15:44] P.1 (1-24)
BULLETIN OF THE POLISH ACADEMY OF SCIENCES
2012 IEEE 12th International Conference on Data Mining Workshops 2012 IEEE 12th International Conference on Data Mining Workshops
2012 IEEE 12th International Conference on Data Mining Workshops 2012 IEEE 12th International Conference on Data Mining Workshops
Downloaded by http://iranpaper.ir ﺏﺎﺘﮐ ﻭ ﻪﻟﺎﻘﻣ ﻥﺎﮕﯾﺍﺭ ﺩﻮﻠﻧﺍﺩ ﻪﻧﺎﻣﺎﺳ
Chapter 15
2214 B. Luo et al./Pattern Recognition 36 (2003) 2213–2230
One way around this problem is to adopt a pairwise
Int. J. Appl. Comput. Math (2015) 1:503–511
Available online at www.sciencedirect.com
Predictive partitioning for efficient BFS
Chapter 15
Journal of Network and Computer Applications 48 (2015) 99–117
Journal of Network and Computer Applications 48 (2015) 99–117
FutureGenerationComputerSystems32(2014)324–337
Available online at www.sciencedirect.com
Available online at www.sciencedirect.com
J.ParallelDistrib.Comput.74(2014)2400–2410
Procedia Computer Science
Combinatorial Model and Bounds for Target Set Selection
CanadianMathematicalBulletin
Remarks on Dynamic Monopolies with Given Average Thresholds
∗
Vedran Podobnik and Ignac Lovrek / Procedia Computer Science 60 ( 2015 ) 583 – 592 587
Organizations like NASA regularly receive terabytes of incoming data from
Graph Pattern Matching Revised for Social Network Analysis
Matching Structure and Semantics:
BetweennessCentralityonGPUsandHeterogeneous
European Journal of Operational Research 257 (2017) 1–12
European Journal of Operational Research 257 (2017) 1–12
Downloaded from http://iranpaper.ir
Downloaded from http://iranpaper.ir
it is often necessary to make the pins of several
it is often necessary to make the pins of several
Varying Graph Data Abstract This work presents a novel modeling
Jurgen A. Doornik
Detecting Anomalies in Online Social Networks using Graph Metrics Abstract
Linear Algebra and its Applications 519 (2017) 136–145
subgraph2vec: LearningDistributedRepresentationsof
subgraph2vec: LearningDistributedRepresentationsof
subgraph2vec: LearningDistributedRepresentationsof
Executing dynamic data-graph computations
XBF: Scaling up Bloom-filter-based Source Routing
Algorithms 2013, 6, 618-635; doi:10.3390/a6040618
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication.
Graph-based Ranking Algorithms for Sentence Extraction,
Graph-based Ranking Algorithms for Sentence Extraction,
Graph-based Ranking Algorithms for Sentence Extraction,
Graph-based Ranking Algorithms for Sentence Extraction,
COMPUTER SCIENCE REVIEW 7 (2013) 1–34
Chapter 1
Efficient Influence Maximization in Social Networks
subgraph2vec: LearningDistributedRepresentationsof
Large-Scale Frequent Subgraph Mining in
CHAPTER 2
نحوه ی web mining در فیسبوک
subgraph2vec: LearningDistributedRepresentationsof
Ef cient Aggregation for Graph Summarization
0
JVM only
PHOTOVOLTAICS REPORT
IntJ AdvManuf Technol
Management and Analysis of Big Graph Data:
Management and Analysis of Big Graph Data:
Journal of Computer and System Sciences 74 (2008) 546–556
Journal of Computer and System Sciences 74 (2008) 546–556
Journal of Computer and System Sciences 74 (2008) 546–556
Journal of Computer and System Sciences 74 (2008) 546–556
Graphic sequences, distances and k-degree anonymity
In pattern recognition, dimensionality reduction is an effective technique to solve the “curse of
4.2. History-based constraint modellers
The normalized Gaussian function is defined as FWHM is acronym
Predicting Edge Signs in Social
576 Chapter 8 GRAPH THEORY
it is very important to start by providing an overview
DiscoveringLatentNetworkStructureinPointProcessData
CSE 471/598 � Introduction to Artificial intelligence http://www.public.asu.edu/~huanliu/AI04S/project1.htm
هوش مصنوعی
Big Graph Analytics: The State of the Art
CHAPTER10
BigGraphAnalyticsSystems
Big Graph Analytics: The State of the Art
CHAPTER10
BigGraphAnalyticsSystems
2018 International Conference on Field-Programmable Logic and Applications
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2021.3092185, IEEE Internet of
we introduce some example problems and systems from multiple disciplines
we introduce some example problems and systems from multiple disciplines
we introduce some example problems and systems from multiple disciplines
We pay special attention to how the structure of the
The Incidence Matrix and its Applications After studying adjacency and
The Incidence Matrix and its ApplicationsAfter studying adjacency and
we introduce some example problems and systems from multiple disciplines
Journal Pre-proofs
Journal Pre-proofs
23 MinimumSpanningTrees
23 MinimumSpanningTrees
23 MinimumSpanningTrees
23 MinimumSpanningTrees
23 MinimumSpanningTrees
Under review as a conference paper at ICLR 2022