检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
9 册 图书

馆藏范围

337 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

336 篇 工学
- 336 篇 计算机科学与技术...
- 107 篇 信息与通信工程
- 18 篇 软件工程
130 篇 理学
- 130 篇 数学

主题

12 篇 event-b
10 篇 multi-objective ...
8 篇 genetic programm...
8 篇 evolutionary alg...
7 篇 computers
6 篇 refinement
6 篇 formal methods
6 篇 runtime analysis
5 篇 reinforcement le...
5 篇 approximation al...
5 篇 robots
5 篇 combinatorial op...
5 篇 verification
4 篇 graph algorithms
4 篇 deep learning
4 篇 model checking
4 篇 abstract state m...
4 篇 graph theory
4 篇 theory
4 篇 machine learning

机构

6 篇 sorbonne univ li...
5 篇 swiss fed inst t...
5 篇 univ bergen dept...
5 篇 eindhoven univ t...
5 篇 univ southampton...
5 篇 zhejiang univ ui...
4 篇 univ utrecht utr...
4 篇 charles univ pra...
4 篇 univ tokyo jfli ...
4 篇 univ dusseldorf ...
3 篇 tech univ darmst...
3 篇 slovak acad sci ...
3 篇 univ warsaw inst...
3 篇 univ primorska f...
3 篇 ryerson univ dep...
3 篇 beijing univ tec...
3 篇 univ milan dipar...
3 篇 beijing univ tec...
3 篇 warsaw univ tech...
3 篇 itmo univ st pet...

作者

6 篇 doerr carola
6 篇 leuschel michael
5 篇 schewe klaus-die...
5 篇 doerr benjamin
4 篇 neumann frank
4 篇 coello carlos a....
4 篇 butler michael
4 篇 back thomas
4 篇 liefooghe arnaud
4 篇 hoang thai son
4 篇 riccobene elvini...
3 篇 neumann aneta
3 篇 bloznelis mindau...
3 篇 sudo yuichi
3 篇 yao xin
3 篇 ait-ameur yamine
3 篇 taubenfeld gadi
3 篇 bossek jakob
3 篇 snook colin
3 篇 paulusma daniel

语言

336 篇 英文
5 篇 中文

检索条件"丛书名=Lecture Notes in Computer Science - Theoretical Computer Science and General Issues"

共 341 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Streaming Algorithms for Budgeted k-Submodular Maximization Problem 10th

Streaming Algorithms for Budgeted k-Submodular Maximization ...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Pham, Canh V. Vu, Quang C. Ha, Dung K. T. Nguyen, Tai T. Phenikaa Univ ORlab Fac Comp Sci Hanoi 12116 Vietnam Peoples Secur Acad Fac Informat Secur Hanoi Vietnam Vietnam Natl Univ Fac Informat Technol Univ Engn & Technol Hanoi Vietnam

ISBN: (纸本)9783030914349;9783030914332

Stimulated by practical applications arising from viral marketing. This paper investigates a novel Budgeted k-Submodular Maximization problem defined as follows: Given a finite set V, a budget B and a k-submodular function f : (k + 1)(V) sic R+, the problem asks to find a solution s = (S-1, S-2,..., S-k), each element e is an element of V has a cost c(i)(e) to be put into i-th set S-i, with the total cost of s does not exceed B so that f(s) is maximized. To address this problem, we propose two streaming algorithms that provide approximation guarantees for the problem. In particular, in the case of each element e has the same cost for all i-th sets, we propose a deterministic streaming algorithm which provides an approximation ratio of 1/4 - is an element of when f is monotone and 1/5 - is an element of when f is nonmonotone. For the general case, we propose a random streaming algorithm that provides an approximation ratio of min{a/2, (1- a)k/(1+ss)k-ss}-is an element of when f is monotone and min{a 2, (1-a)k/ (1+2 ss)k- 2 ss} - is an element of when f is non-monotone in expectation, where ss = maxe is an element of V-,V-i,V-j is an element of[k],V-i not equal j ci(e) /cj (e) and is an element of, alpha are fixed inputs.

关键词： k-submodular Budget constraint Approximation algorithm Streaming algorithm

来源：评论

学校读者我要写书评

暂无评论

Block Elimination Distance 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Diner, Oznur Yasar Giannopoulou, Archontia C. Stamoulis, Giannos Thilikos, Dimitrios M. Kadir Has Univ Comp Engn Dept Istanbul Turkey Univ Politecn Cataluna Dept Math Barcelona Spain Natl & Kapodistrian Univ Athens Dept Informat & Telecommun Athens Greece Univ Montpellier LIRMM Montpellier France Univ Montpellier CNRS LIRMM Montpellier France

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

We introduce the parameter of block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class G, the class B(G) contains all graphs whose blocks belong to G and the class A(G) contains all graphs where the removal of a vertex creates a graph in G. Given a hereditary graph class G, we recursively define G((k)) so that G((0)) = B(G) and, if k >= 1, G((k)) = B(A(G((k-1)))). The block elimination distance of a graph G to a graph class G is the minimum k such that G is an element of G((k)) and can be seen as an analog of the elimination distance parameter, defined in [J. Bulian & A. Dawar. Algorithmica, 75(2):363-382, 2016], with the difference that connectivity is now replaced by biconnectivity. We show that, for every non-trivial hereditary class G, the problem of deciding whether G. G(k) is NPcomplete. We focus on the case where G is minor-closed and we study the minor obstruction set of G((k)) i.e., the minor-minimal graphs not in G((k)). We prove that the size of the obstructions of G((k)) is upper bounded by some explicit function of k and the maximum size of a minor obstruction of G. This implies that the problem of deciding whether G is an element of G((k)) is constructively fixed parameter tractable, when parameterized by k. Our results are based on a structural characterization of the obstructions of B(G), relatively to the obstructions of G. Finally, we give two graph operations that generate members of G((k)) from members of G((k-1)) and we prove that this set of operations is complete for the class O of outerplanar graphs. This yields the identification of all members O boolean AND G((k)), for every k is an element of N and every non-trivial minor-closed graph class G.

关键词： Elimination distance Graph minors Obstructions Parameterized algorithms Biconnected graphs

来源：评论

学校读者我要写书评

暂无评论

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs 28th

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Gorain, Barun Mondal, Kaushik Nayak, Himadri Pandit, Supantha Indian Inst Technol Bhilai Raipur Chhattisgarh India Indian Inst Technol Ropar Rupnagar Punjab India Indian Inst Informat Technol Bhagalpur India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India

ISBN: (纸本)9783030795269;9783030795276

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as 0, 1, ..., deg(v) - 1. A mobile agent, starting from a node, must find a stationary object, called treasure that is located on an unknown node at a distance D from its initial position. The agent finds the treasure when it reaches the node where the treasure is present. The time of treasure hunt is defined as the number of edges the agent visits before it finds the treasure. The agent does not have any prior knowledge about the graph or the position of the treasure. An Oracle, that knows the graph, the initial position of the agent, and the position of the treasure, places some pebbles on the nodes, at most one per node, of the graph to guide the agent towards the treasure. We target to answer the question: what is the fastest possible treasure hunt algorithm regardless of the number of pebbles are placed? We show an algorithm that uses O(D log triangle) pebbles to find the treasure in a graph G in time O(D log triangle+ log(3) triangle), where triangle is the maximum degree of a node in G and D is the distance from the initial position of the agent to the treasure. We show an almost matching lower bound of O(D log triangle) on time of the treasure hunt using any number of pebbles.

关键词： Treasure hunt Mobile agent Anonymous graph Pebbles

来源：评论

学校读者我要写书评

暂无评论

Distributed Algorithms for Fractional Coloring 28th

Distributed Algorithms for Fractional Coloring

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Bousquet, Nicolas Esperet, Louis Pirot, Francois Univ Claude Bernard Lyon 1 Lab LIRIS CNRS UMR 5205 Lyon France Univ Grenoble Alpes Lab G SCOP CNRS Grenoble France

ISBN: (纸本)9783030795269;9783030795276

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by Hasemann, Hirvonen, Rybicki and Suomela [19] that for every real alpha > 1 and integer Delta, a fractional coloring of total weight at most alpha(Delta + 1) can be obtained deterministically in a single round in graphs of maximum degree Delta, in the LOCAL model of computation. However, a major issue of this result is that the output of each vertex has unbounded size. Here we prove that even if we impose the more realistic assumption that the output of each vertex has constant size, we can find fractional colorings of total weight arbitrarily close to known tight bounds for the fractional chromatic number in several cases of interest. More precisely, we show that for any fixed epsilon > 0 and Delta, a fractional coloring of total weight at most Delta+epsilon can be found in Omega(log* n) rounds in graphs of maximum degree Delta with no K Delta+1, while finding a fractional coloring of total weight at most Delta in this case requires Omega(log log n) rounds for randomized algorithms and Omega(log n) rounds for deterministic algorithms. We also show how to obtain fractional colorings of total weight at most 2+ epsilon in grids of any fixed dimension, for any epsilon > 0, in O(log* n) rounds. Finally, we prove that in sparse graphs of large girth from any proper minor-closed family we can find a fractional coloring of total weight at most 2+ epsilon, for any epsilon > 0, in O(log n) rounds.

关键词： Fractional coloring Graph coloring Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Threshold-Based Network Structural Dynamics 28th

Threshold-Based Network Structural Dynamics

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Kipouridis, Evangelos Spirakis, Paul G. Tsichlas, Kostas Univ Copenhagen Basic Algorithms Res Copenhagen BARC Univ Pk 1 DK-2100 Copenhagen Denmark Univ Liverpool Dept Comp Sci Ashton St Liverpool L69 3BX Merseyside England Univ Patras Comp Engn & Informat Dept Patras Greece

ISBN: (纸本)9783030795269;9783030795276

The interest in dynamic processes on networks is steadily rising in recent years. In this paper, we consider the (alpha, beta)-Thresholded Network Dynamics ((alpha, beta)-Dynamics), where alpha <= beta, in which only structural dynamics (dynamics of the network) are allowed, guided by local thresholding rules executed by each node. In particular, in each discrete round t, each pair of nodes u and v that are allowed to communicate by the scheduler, computes a value epsilon(u, v) (the potential of the pair) as a function of the local structure of the network at round t around the two nodes. If epsilon(u, v) < alpha then the link (if it exists) between u and v is removed;if alpha <= epsilon(u, v) < beta then an existing link among u and v is maintained;if beta <= epsilon( u, v) then a link between u and v is established if not already present. The microscopic structure of (alpha, beta)-Dynamics appears to be simple, so that we are able to rigorously argue about it, but still flexible, so that we are able to design meaningful microscopic local rules that give rise to interesting macroscopic behaviors. Our goals are the following: a) to investigate the properties of the (alpha, beta)-Thresholded Network Dynamics and b) to show that (alpha, beta)-Dynamics is expressive enough to solve complex problems on networks. Our contribution in these directions is twofold. We rigorously exhibit the claim about the expressiveness of (alpha, beta)-Dynamics, both by designing a simple protocol that provably computes the k-core of the network as well as by showing that (alpha, beta)-Dynamics are in fact Turing-Complete. Second and most important, we construct general tools for proving stabilization that work for a subclass of (alpha, beta)-Dynamics and prove speed of convergence in a restricted setting.

关键词： Network dynamics Stabilization

来源：评论

学校读者我要写书评

暂无评论

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Rymar, Maciej Molter, Hendrik Nichterlein, Andre Niedermeier, Rolf TU Berlin Algorithm & Computat Complex Berlin Germany Ben Gurion Univ Negev Dept Ind Engn & Management Beer Sheva Israel

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in temporal graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static case, there are numerous natural notions of being a "shortest" temporal path (walk). Depending on which notion is used, it was already observed that the problem is #P-hard in some cases while polynomial-time solvable in others. In this conceptual work, we contribute towards classifying what a "shortest path (walk) concept" has to fulfill in order to gain polynomial-time computability of temporal betweenness centrality.

关键词： Temporal graphs Temporal paths and walks Network science Network centrality measures Counting complexity

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Based Traffic Sign Detection for Intelligent Transportation Systems 10th

A Deep Learning Based Traffic Sign Detection for Intelligent...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Le, Bao-Long Lam, Gia-Huy Nguyen, Xuan-Vinh Nguyen, The-Manh Duong, Quoc-Loc Tran, Quang Dieu Do, Trong-Hop Dao, Nhu-Ngoc Univ Informat Technol Ho Chi Minh City Vietnam Vietnam Natl Univ Ho Chi Minh City Vietnam Ho Chi Minh Natl Acad Polit Hanoi Vietnam Sejong Univ Dept Comp Sci & Engn Seoul South Korea

ISBN: (纸本)9783030914349;9783030914332

Automatic detection and classification of traffic signs [1] bring convenience and caution to drivers on the road. It provides drivers with accuracy and timeliness in compliance as well as notifications in the route they are on. In the field of computer vision, the problem of detecting and classifying traffic signs has attracted great attention from research communities, because of the consequences it can bring if any mistake is made. In this problem, we have built a highly realistic data set with many challenges for Vietnam's traffic. In addition, we also solve the problem of automatic detection [2] and classification of traffic signs on the dataset that we have built using YOLOv4 and YOLOv5 algorithms with fine-tuned parameters. The results obtained in this paper are that the accuracy in detecting and classifying signs is quite high and the error is very low compared to outside traffic in Vietnam. The article is expected to benefit the development of practical applications and bring certain contributions in further developing this issue.

关键词： Traffic sign detection Smart car Intelligent transportation system

来源：评论

学校读者我要写书评

暂无评论

The Graphs of Stably Matchable Pairs 47th

The Graphs of Stably Matchable Pairs

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Eppstein, David Univ Calif Irvine Comp Sci Dept Irvine CA 92617 USA

ISBN: (纸本)9783030868376;9783030868383

We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing these graphs, a recognition algorithm that is singly exponential in the number of edges of the given graph, and an algorithm whose time is linear in the number of vertices of the graph but exponential in a polynomial of its carving width.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Wait-Free Approximate Agreement on Graphs 28th

Wait-Free Approximate Agreement on Graphs

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Alistarh, Dan Ellen, Faith Rybicki, Joel IST Austria Klosterneuburg Austria Univ Toronto Toronto ON Canada

ISBN: (纸本)9783030795269;9783030795276

Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that - all the outputs are within distance 1 of one another, and - each output value lies on a shortest path between two input values. From prior work, it is known that there is no wait-free algorithm among n >= 3 processes for this problem on any cycle of length c >= 4, by reduction from 2-set agreement (Castaneda et al. 2018). In this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length c >= 4, via a generalisation of Sperner's Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs.

关键词： Approximate agreement Wait-free Extension-based proofs

来源：评论

学校读者我要写书评

暂无评论

Testing Equality Under the Local Broadcast Model 28th

Testing Equality Under the Local Broadcast Model

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Khan, Muhammad Samir Vaidya, Nitin H. Univ Illinois Dept Comp Sci Urbana IL 61801 USA Georgetown Univ Dept Comp Sci Washington DC USA

ISBN: (纸本)9783030795269;9783030795276

In the multiparty equality problem, each of the n nodes starts with a k-bit input. If there is a mismatch between the inputs, then at least one node must be able to detect it. The cost of a multiparty equality protocol is the total number of bits sent in the protocol. We consider the problem of minimizing this communication cost under the local broadcast model for the case where the underlying communication graph is undirected. In the local broadcast model of communication, a message sent by a node is received identically by all of its neighbors. This is in contrast to the classical point-to-point communication model, where a message sent by a node to one of its neighbors is received only by its intended recipient. Under point-to-point communication, there exists a simple protocol which is competitive within a factor 2 of the lower bound [1]. In this protocol, a rooted spanning tree is fixed and each node sends its entire input to its parent in the tree. On receiving a value from its child, a node compares it against its own input to check if the two values match. Ignoring lower order additive terms, a more complicated protocol comes within a factor 4/3 of the lower bound and is tight for certain classes of graphs [1]. Tight results, ignoring lower order terms, are also known for complete graphs [2,9]. We study the multiparty equality problem under the local broadcast model. Recently, our work has shown that the connectivity requirements for Byzantine consensus are lower in the local broadcast model as compared to the classical model [7,8]. In this work, 1. we identify a lower bound for the multiparty equality problem in this model. 2. we first identify simple protocols, wherein nodes are restricted to either transmit their entire input or not transmit anything at all, and find that these can cost O(log n) times the lower bound using existing example for the set cover problem [12]. 3. we then design a protocol to solve the problem within a constant factor of the low

关键词： Communication complexity Multiparty equality Static protocols Local broadcast

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共35页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：