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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 期刊文献
125 篇 会议

馆藏范围

320 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

245 篇 理学
- 235 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 系统科学
- 13 篇 物理学
- 3 篇 化学
- 3 篇 地球物理学
- 3 篇 生物学
168 篇 工学
- 123 篇 计算机科学与技术...
- 78 篇 软件工程
- 37 篇 土木工程
- 34 篇 建筑学
- 23 篇 测绘科学与技术
- 17 篇 材料科学与工程（可...
- 11 篇 信息与通信工程
- 11 篇 控制科学与工程
- 10 篇 电子科学与技术（可...
- 5 篇 电气工程
- 4 篇 农业工程
- 3 篇 机械工程
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 生物工程
- 2 篇 轻工技术与工程
- 2 篇 林业工程
- 2 篇 生物医学工程（可授...
30 篇 管理学
- 18 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
4 篇 法学
- 4 篇 社会学
4 篇 农学
- 4 篇 作物学
1 篇 经济学
1 篇 教育学

主题

24 篇 parameterization
18 篇 graph theory
14 篇 polynomial appro...
12 篇 graphic methods
11 篇 trees (mathemati...
11 篇 parameter estima...
9 篇 approximation al...
9 篇 directed graphs
8 篇 drawing (graphic...
8 篇 computational co...
7 篇 hamiltonians
7 篇 visualization
7 篇 constraint satis...
5 篇 encoding (symbol...
5 篇 computational ge...
5 篇 optimization
4 篇 undirected graph...
4 篇 machine learning
4 篇 clustering algor...
4 篇 polynomials

机构

227 篇 algorithms and c...
17 篇 department of in...
16 篇 department of co...
13 篇 algorithms and c...
9 篇 indian institute...
8 篇 school of comput...
6 篇 faculty of infor...
5 篇 school of comput...
5 篇 school of comput...
5 篇 department of in...
5 篇 department of ap...
5 篇 department of ma...
4 篇 university of le...
4 篇 department of en...
4 篇 department of en...
4 篇 institute of inf...
4 篇 institute of mat...
4 篇 algorithms and c...
4 篇 algorithms and c...
4 篇 cispa helmholtz ...

作者

85 篇 ganian robert
69 篇 nöllenburg marti...
47 篇 szeider stefan
31 篇 eiben eduard
31 篇 bhore sujoy
27 篇 ordyniak sebasti...
18 篇 simonov kirill
17 篇 hamm thekla
17 篇 klute fabian
16 篇 ramanujan m.s.
14 篇 kanj iyad
14 篇 montecchiani fab...
13 篇 wallinger markus
12 篇 golovach petr a.
12 篇 li guangping
12 篇 wulms jules
12 篇 fomin fedor v.
11 篇 rutter ignaz
9 篇 gronemann martin
9 篇 villedieu anaïs

语言

305 篇 英文
15 篇 其他

检索条件"机构=Algorithms and Complexity group"

共 320 条记录，以下是31-40 订阅

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

详细简洁

排序：

Meta-kernelization using well-structured modulators 10

Meta-kernelization using well-structured modulators

引用

10th International Symposium on Parameterized and Exact Computation, IPEC 2015

作者： Eiben, Eduard Ganian, Robert Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783939897927

Kernelization investigates exact preprocessing algorithms with performance guarantees. The most prevalent type of parameters used in kernelization is the solution size for optimization problems;however, also structural parameters have been successfully used to obtain polynomial kernels for a wide range of problems. Many of these parameters can be defined as the size of a smallest modulator of the given graph into a fixed graph class (i.e., a set of vertices whose deletion puts the graph into the graph class). Such parameters admit the construction of polynomial kernels even when the solution size is large or not applicable. This work follows up on the research on meta-kernelization frameworks in terms of structural parameters. We develop a class of parameters which are based on a more general view on modulators: instead of size, the parameters employ a combination of rank-width and split decompositions to measure structure inside the modulator. This allows us to lift kernelization results from modulator-size to more general parameters, hence providing smaller kernels. We show (i) how such large but well-structured modulators can be efficiently approximated, (ii) how they can be used to obtain polynomial kernels for any graph problem expressible in Monadic Second Order logic, and (iii) how they allow the extension of previous results in the area of structural metakernelization. © Eduard Eiben, Robert Ganian, and Stefan Szeider;.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Discovering archipelagos of tractability for constraint satisfaction and counting 27

Discovering archipelagos of tractability for constraint sati...

引用

27th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2016

作者： Ganian, Robert Ramanujan, M.S. Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9781510819672

The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of classes of instances for which CSP can be solved in polynomial time;such classes are often called "islands of tractability." A prominent way of defining islands of tractability for CSP is to restrict the relations that may occur in the constraints to a fixed set, called a constraint language, whereas a constraint language is conservative if it contains all unary relations. Schaefer's famous Dichotomy Theorem (STOC 1978) identifies all islands of tractability in terms of tractable constraint languages over a Boolean domain of values. Since then many extensions and generalizations of this result have been obtained. Recently, Bulatov (TOCL 2011, JACM 2013) gave a full characterization of all islands of tractability for CSP and the counting version #CSP that are defined in terms of conservative constraint languages. This paper addresses the general limit of the mentioned tractability results for CSP and #CSP, that they only apply to instances where all constraints belong to a single tractable language (in general, the union of two tractable languages isn't tractable). We show that we can overcome this limitation as long as we keep some control of how constraints over the various considered tractable languages interact with each other. For this purpose we utilize the notion of a strong backdoor of a CSP instance, as introduced by Williams et al. (DCAI 2003), which is a set of variables that when instantiated moves the instance to an island of tractability, i.e., to a tractable class of instances. We consider strong backdoors into scattered classes, consisting of CSP instances where each connected component belongs entirely to some class from a list of tractable classes. Figuratively speaking, a scattered class constitutesan archipelago

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

The Power of Collaboration: Learning Large Bayesian Networks at Scale 36

The Power of Collaboration: Learning Large Bayesian Networks...

引用

36th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2024

作者： Ramaswamy, Vaidyanathan Peruvemba Szeider, Stefan Xia, Hai Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9798331527235

We present a novel approach to learn the structure of large Bayesian Networks (BNs) of bounded treewidth. Our approach combines the complementary strengths of heuristic and MaxSAT-based methods. Both methods operate in parallel and cooperate in a mutually advantageous way to improve the quality of the learned BN structures. Our work utilizes an approach proposed by Peruvemba Ramaswamy and Szeider (AAAI'21, NeurIPS'21, UAI'22), which continually applies a MaxSAT-based algorithm to a BN obtained from heuristic search. We create a continuous and dynamic refinement process by allowing the heuristic and the MaxSAT-based technique to cooperate and repeatedly share their work. Our rigorous experiments show that the collaboration between the two methods is a powerful strategy for increasing the score of the learned BN structure. Moreover, the rate at which the score increases is significantly higher than that of the individual methods by themselves. Our results provide a strong argument for combining complementary approaches to learn treewidth-bounded BNs in a collaborative way. © 2024 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Block Crossings in One-Sided Tanglegrams 18th

Block Crossings in One-Sided Tanglegrams

引用

18th International Symposium on algorithms and Data Structures, WADS 2023

作者： Dobler, Alexander Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783031389054

Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines. Instead of minimizing the number of pairwise edge crossings, we consider the problem of minimizing the number of block crossings, that is, two bundles of lines crossing each other locally. With one tree fixed, the leaves of the second tree can be permuted according to its tree structure. We give a complete picture of the algorithmic complexity of minimizing block crossings in one-sided tanglegrams by showing NP -completeness, constant-factor approximations, and a fixed-parameter algorithm. We also state first results for non-binary trees. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

On structural parameterizations of the edge disjoint paths problem 28

On structural parameterizations of the edge disjoint paths p...

引用

28th International Symposium on algorithms and Computation, ISAAC 2017

作者： Ganian, Robert Ordyniak, Sebastian Sridharan, Ramanujan Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783959770545

In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our focus lies on structural parameterizations for the problem that allow for efficient (polynomial-Time or fpt) algorithms. As our first result, we answer an open question stated in Fleszar, Mnich, and Spoerhase (2016), by showing that the problem can be solved in polynomial time if the input graph has a feedback vertex set of size one. We also show that EDP parameterized by the treewidth and the maximum degree of the input graph is fixed-parameter tractable. Having developed two novel algorithms for EDP using structural restrictions on the input graph, we then turn our attention towards the augmented graph, i.e., the graph obtained from the input graph after adding one edge between every terminal pair. In constrast to the input graph, where EDP is known to remain NP-hard even for treewidth two, a result by Zhou et al. (2000) shows that EDP can be solved in non-uniform polynomial time if the augmented graph has constant treewidth;we note that the possible improvement of this result to an fpt-Algorithm has remained open since then. We show that this is highly unlikely by establishing the W[1]-hardness of the problem parameterized by the treewidth (and even feedback vertex set) of the augmented graph. Finally, we develop an fpt-Algorithm for EDP by exploiting a novel structural parameter of the augmented graph.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Layered Area-Proportional Rectangle Contact Representations 29th

Layered Area-Proportional Rectangle Contact Representations

引用

29th International Symposium on Graph Drawing and Network Visualization, GD 2021

作者： Nöllenburg, Martin Villedieu, Anaïs Wulms, Jules Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783030929305

We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoint unit-height rectangles of prescribed widths, grouped in one row per layer, and each edge is ideally realized as a rectangle contact of positive length. Such rectangle contact representations find applications in semantic word or tag cloud visualizations, where a collection of words is displayed such that pairs of semantically related words are close to each other. In this paper, we want to maximize the number of realized rectangle contacts or minimize the overall area of the rectangle contact representation, while avoiding any false adjacencies. We present a network flow model for area minimization, a linear-time algorithm for contact maximization of two-layer graphs, and an ILP model for maximizing contacts of k-layer graphs. © 2021, Springer Nature Switzerland AG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ASP-QRAT: a Conditionally Optimal Dual Proof System for ASP 21

ASP-QRAT: a Conditionally Optimal Dual Proof System for ASP

引用

21st International Conference on Principles of Knowledge Representation and Reasoning, KR 2024

作者： Chew, Leroy de Colnet, Alexis Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9781956792058

Answer Set Programming (ASP) is a declarative programming approach that captures many problems in knowledge representation and reasoning. To certify an ASP solver’s decision, whether the program is consistent or inconsistent, we need a certificate or proof that can be independently verified. This paper proposes the dual proof system ASP-QRAT that certifies consistent and inconsistent ASPs. ASP-QRAT is based on a translation of ASP to QBF (Quantified Boolean Formulas) and the QBF proof system QRAT as a checking format. We show that ASP-QRAT p-simulates ASP-DRUPE, an existing refutation system for inconsistent disjunctive ASPs. We show that ASP-QRAT is conditionally optimal for consistent and inconsistent ASPs, i.e., any super-polynomial lower bound on the shortest proof size of ASP-QRAT implies a major breakthrough in theoretical computer science. The case for consistent ASPs is remarkable because no analog exists in the QBF case. © 2024 Proceedings of the International Conference on Knowledge Representation and Reasoning. All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

The complexity of Optimizing Atomic Congestion 38

The Complexity of Optimizing Atomic Congestion

引用

38th AAAI Conference on Artificial Intelligence, AAAI 2024

作者： Brand, Cornelius Ganian, Robert Kalyanasundaram, Subrahmanyam Inerney, Fionn Mc Algorithms & Complexity Theory Group Regensburg University Germany Algorithms and Complexity Group TU Wien Austria Department of Computer Science and Engineering IIT Hyderabad India

ISBN: (纸本)1577358872

Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various application areas. While both the price of anarchy for such games as well as the computational complexity of computing their Nash equilibria are by now well-understood, the computational complexity of computing a system-optimal set of strategies—that is, a centrally planned routing that minimizes the average cost of agents—is severely understudied in the literature. We close this gap by identifying the exact boundaries of tractability for the problem through the lens of the parameterized complexity paradigm. After showing that the problem remains highly intractable even on extremely simple networks, we obtain a set of results which demonstrate that the structural parameters which control the computational (in)tractability of the problem are not vertex-separator based in nature (such as, e.g., treewidth), but rather based on edge separators. We conclude by extending our analysis towards the (even more challenging) min-max variant of the problem. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Minimizing Switches in Cased Graph Drawings 32

Minimizing Switches in Cased Graph Drawings

引用

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Ganian, Robert Nöllenburg, Martin Röder, Sebastian Algorithms and Complexity Group TU Wien Austria TU Wien Austria

ISBN: (纸本)9783959773430

In cased drawings of graphs, edges are drawn in front of others in order to decrease the negative impact of crossings on readability. In this context, a switch on an edge is defined as two consecutive crossings, where the edge is drawn in the front at one crossing and behind another edge at the next crossing. We investigate the problem of minimizing the maximum number of switches on any edge - both in a fixed drawing as well as for non-embedded graphs. We resolve an open question by Eppstein, van Kreveld, Mumford, and Speckmann (2009) by establishing the NP-hardness of minimizing the number of switches in a fixed drawing, provide a fixed-parameter algorithm for this problem, and obtain a full characterization of the problem for non-embedded graphs. © Robert Ganian, Martin Nöllenburg, and Sebastian Röder.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Transitions in Dynamic Point Labeling 12

Transitions in Dynamic Point Labeling

引用

12th International Conference on Geographic Information Science, GIScience 2023

作者： Depian, Thomas Li, Guangping Nöllenburg, Martin Wulms, Jules Algorithms and Complexity Group TU Wien Austria Algorithm Engineering Group TU Dortmund Germany

ISBN: (纸本)9783959772884

The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point features and their corresponding labels change, and the labeling has to adapt to such changes. To aid the user in tracking these changes, we can use morphs, here called transitions, to indicate how a labeling changes. Such transitions have not gained much attention yet, and we investigate different types of transitions for labelings of points, most notably consecutive transitions and simultaneous transitions. We give (tight) bounds on the number of overlaps that can occur during these transitions. When each label has a (non-negative) weight associated to it, and each overlap imposes a penalty proportional to the weight of the overlapping labels, we show that it is NP-complete to decide whether the penalty during a simultaneous transition has weight at most k. Finally, in a case study, we consider geotagged Twitter data on a map, by labeling points with rectangular labels showing tweets. We developed a prototype implementation to evaluate different transition styles in practice, measuring both number of overlaps and transition duration. © Thomas Depian, Guangping Li, Martin Nöllenburg, and Jules Wulms.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：