搜索结果: 1-13 共查到“计算机科学技术 graphs”相关记录13条 . 查询时间(0.015 秒)
“展宏图，觅灵机”图灵班系列讲座第3讲：樊文飞院士解读“Big Graphs”（图）
图灵班 第3讲 樊文飞 Big Graphs 数据库
2023/11/30
2023年2月22日，中国科学院外籍院士、英国皇家学会院士樊文飞教授做客南科大。樊院士主要从事数据库理论与系统方面的研究，此次围绕“大规模图数据（Big Graphs）”主题，与在场师生分享了他对此方面的深刻见解。会议由计算机科学与工程系主任姚新教授主持，副主任王琦副教授、计算机系部分教师、图灵班各年级学生以及部分研究生到场聆听了报告。
Busy GPUs: Sampling and pipelining method speeds up deep learning on large graphs（图）
GPU 流水线 大型图形 深度学习
2023/6/20
Graphs, a potentially extensive web of nodes connected by edges, can be used to express and interrogate relationships between data, like social connections, financial transactions, traffic, energy gri...
Partial Online Cycle Elimination in Inclusion Constraint Graphs
Partial Online Cycle Elimination Inclusion Constraint Graphs
2016/5/24
Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: rst, that onl...
Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs
Projection Merging Reducing Redundancies Inclusion Constraint Graphs
2016/5/24
Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many di erent ways to add a transitive edge between two nodes, namely through each ...
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs
Top-k Selection Multi-Armed Bandits Hidden Bipartite Graphs
2016/1/22
This paper discusses how to efficiently choose from n unknown distributions the k ones whose means are the greatest by a certain metric, up to a small relative error.We study the topic under two stand...
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayatil Andrea Montanari
2015/8/20
‘Approximate message passing’ algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive numerical experiments furthe...
Network lasso: Clustering and optimization in large graphs
Convex Optimization ADMM Network Lasso
2015/8/7
Convex optimization is an essential tool for modern data analysis, as it provides a framework to formulate and solve many problems in machine learning and data mining. However, general convex optimiza...
Basis Construction and Utilization for Markov Decision Processes Using Graphs
Markov decision process Reinforcement learning Representation discovery
2014/12/18
The ease or difficulty in solving a problemstrongly depends on the way it is represented. For example, consider the task of multiplying the numbers 12 and 24. Now imagine multiplying XII and XXIV. Bot...
Scheduling Heuristics for Maximizing the Output Quality of IRIS Task Graphs in Multiprocessor Environment with Time and Energy Bounds
precedence constraints computational load cost functions reward service dynamic voltage scaling
2014/12/8
Embedded real time applications are often subject to time and energy constraints. Real time applications are usually characterized by logically separable set of tasks with precedence constraints. The ...
Signed (b,k)-Edge Covers in Graphs
Signed Star Dominating Function Signed Star Domination Number Signed -edge Cover Signed -edge Cover Number
2013/1/28
Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least v...
Total Domination number of Generalized Petersen Graphs
generalized Petersen graphs total domination set total domination number regular graph domi- nation set domination number
2013/1/29
Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in th...
Distributed 2-Vertex Connectivity Test of Graphs Using Local Knowledge
Distributed computing fault-tolerance graph relabeling systems
2010/2/2
The vertex connectivity of a graph is the smallest
number of vertices whose deletion separates the graph or makes it
trivial. This work is devoted to the problem of vertex connectivity
test of grap...
PEDAGOGICAL KNOWLEDGE MODEL BASED ON CONCEPTUAL GRAPHS AND ONTOLOGY
Intelligent educational systems Pedagogical knowledge modeling Conceptual graphs
2010/1/12
Intelligent educational systems are knowledge-based systems (KBS) they can be developed by a generic knowledge-based system development methodology. In this paper, we present an ontology-based approac...