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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

216 篇 会议
19 册 图书
7 篇 期刊文献

馆藏范围

241 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

150 篇 工学
- 139 篇 计算机科学与技术...
- 59 篇 软件工程
- 17 篇 信息与通信工程
- 15 篇 电气工程
- 8 篇 控制科学与工程
- 4 篇 化学工程与技术
- 3 篇 建筑学
- 3 篇 土木工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
- 2 篇 生物医学工程（可授...
66 篇 理学
- 51 篇 数学
- 9 篇 物理学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 5 篇 系统科学
- 4 篇 化学
18 篇 管理学
- 12 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
6 篇 教育学
- 6 篇 教育学
3 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 药学(可授医学、理...
1 篇 文学
- 1 篇 新闻传播学

主题

13 篇 graph theory
11 篇 artificial intel...
9 篇 discrete mathema...
8 篇 automata theory
7 篇 theory of comput...
7 篇 software enginee...
6 篇 complexity theor...
5 篇 computer communi...
5 篇 algorithm analys...
5 篇 information stor...
4 篇 software enginee...
4 篇 database managem...
4 篇 computers
4 篇 game theory
4 篇 data structures
4 篇 information retr...
3 篇 computer science
3 篇 turing machines
3 篇 information syst...
3 篇 switches

机构

3 篇 charles universi...
3 篇 university of be...
3 篇 department of in...
2 篇 department of co...
2 篇 school of electr...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 univ utrecht utr...
2 篇 department of ep...
2 篇 department of me...
2 篇 software enginee...
2 篇 school of mathem...
2 篇 school of automa...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 school of eecs o...
2 篇 department of co...
2 篇 department of co...
1 篇 university of ca...

作者

3 篇 mária bieliková
3 篇 van leeuwen jan
3 篇 inenaga shunsuke
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 paulusma daniel
2 篇 albers susanne
2 篇 kiya hironori
2 篇 rossmanith peter
2 篇 pokorný jaroslav
2 篇 iliopoulos costa...
2 篇 hanaka tesshu
2 篇 jeffery keith g.
2 篇 otto friedrich

语言

238 篇 英文
4 篇 中文

检索条件"任意字段=34th Conference on Current Trends in Theory and Practice of Computer Science"

共 242 条记录，以下是21-30 订阅

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

详细简洁

排序：

Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs 50th

Minimal Schnyder Woods and Long Induced Paths in 3-Connect...

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Ortlieb, Christian Institute of Computer Science University of Rostock Rostock Germany

ISBN: (纸本)9783031826962

We investigate a new structural property of Schnyder woods: every minimal Schnyder wood of a 3-connected planar graph of order n has a tree of depth at least log2(n)/(3log2(3)). this bound is tight. Our result directly implies that such a graph has an induced path of length at least log2(n)/(3log2(3)), improving the previous best lower bound on the length of such a path. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： 3-connected planar graph depth Induced path Schnyder wood

来源：评论

学校读者我要写书评

暂无评论

the Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem 50th

The Complexity of Counting Turns in the Line-Based Dial-a...

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Lauerbach, Antonio Reiter, Kendra Schmidt, Marie Department of Computer Science University of Würzburg Würzburg Germany

ISBN: (纸本)9783031826962

Dial-a-Ride problems have been proposed to model the challenge to consolidate passenger transportation requests with a fleet of shared vehicles. the line-based Dial-a-Ride Problem (liDARP) is a variant where the passengers are transported along a fixed sequence of stops, with the option of taking shortcuts. In this paper we consider the liDARP with the objective function to maximize the number of transported requests. We investigate the complexity of two optimization problems: the liDARP, and the problem to determine the minimum number of turns needed in an optimal liDARP solution, called the MinTurn problem. Based on a number of instance parameters and characteristics, we are able to state the boundary between polynomially solvable and NP-hard instances for both problems. Furthermore, we provide parameterized algorithms that are able to solve both the liDARP and MinTurn problem. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

Generation of Cycle Permutation Graphs and Permutation Snarks 50th

Generation of Cycle Permutation Graphs and Permutation Sna...

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Goedgebeur, Jan Renders, Jarne Department of Computer Science KU Leuven Kulak Kortrijk8500 Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

ISBN: (纸本)9783031826696

We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a 2-factor consisting of two chordless cycles, and non-hamiltonian cycle permutation graphs, from which the permutation snarks can easily be computed. this allows us to generate all cycle permutation graphs up to order 34 and all permutation snarks up to order 46, improving upon previous computational results by Brinkmann et al. Moreover, we give several improved lower bounds for interesting permutation snarks, such as for a smallest permutation snark of order 6mod8 or a smallest permutation snark of girth at least 6. these computational results also allow us to complete a characterisation of the orders for which non-hamiltonian cycle permutation graphs exist, answering an open question by Klee from 1972, and yield many more counterexamples to a conjecture by Zhang. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Distance Vector Domination 50th

Distance Vector Domination

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Cordasco, Gennaro Gargano, Luisa Rescigno, Adele A. Department of Psychology University of Campania "L.Vanvitelli" Caserta Italy Department of Computer Science University of Salerno Fisciano Italy

ISBN: (纸本)9783031826696

Identifying and mitigating the spread of fake information is a challenging issue that has become dominant with the rise of social media. We consider a generalization of the Domination problem that can be used to detect a set of individuals who, once immunized, can prevent the spreading of fake narratives. the considered problem, named Distance Vector Domination generalizes both distance and multiple domination, at individual (i.e., vertex) level. We study the parameterized complexity of the problem according to several standard and structural parameters. We prove the W[1]-hardness of the problem with respect to neighborhood diversity, even when all the distances are 1. We also give fixed-parameter algorithms for some variants of the problem and parameter combinations. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Distance Domination Modular-width Neighborhood diversity Parameterized complexity Treewidth Vector Domination

来源：评论

学校读者我要写书评

暂无评论

Packed Acyclic Deterministic Finite Automata 50th

Packed Acyclic Deterministic Finite Automata

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Shibata, Hiroki Ishihata, Masakazu Inenaga, Shunsuke Joint Graduate School of Mathematics for Innovation Kyushu University Fukuoka Japan NTT Communication Science Laboratories Tokyo Japan Department of Informatics Kyushu University Fukuoka Japan

ISBN: (纸本)9783031826962

An acyclic deterministic finite automaton (ADFA) is a data structure that represents a set of strings (i.e., a dictionary) and facilitates a pattern-searching problem of determining whether a given pattern string is present in the dictionary. We introduce the packed ADFA (PADFA), a compact variant of ADFA designed to achieve more efficient pattern searching by encoding specific paths as packed strings stored in contiguous memory. We theoretically demonstrate that pattern searching in PADFA is near time-optimal with a small additional overhead and becomes fully time-optimal for sufficiently long patterns. Moreover, we prove that a PADFA requires fewer bits than a trie when the dictionary size is relatively smaller than the number of states in the PADFA. Lastly, we empirically show that PADFAs improve both the space and time efficiency of pattern searching on real-world datasets. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

Maximal α-Gapped Repeats in a Fibonacci String 50th

Maximal α-Gapped Repeats in a Fibonacci String

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Yamane, Kazuma Nakashima, Yuto Seto, Kazuhisa Horiyama, Takashi Graduate School of Information Science and Technology Hokkaido University Sapporo Japan Department of Informatics Kyushu University Fukuoka Japan Faculty of Information Science and Technology Hokkaido University Sapporo Japan

ISBN: (纸本)9783031826962

A gapped repeat is a substring of the form uvu where u is any nonempty string called arm, and v is any string called gap. A gapped repeat is maximal if the characters on the left to both arms differ and those on the right to both arms differ. For any real number α≥1, an α-gapped repeat is a gapped repeat such that |u|+|v|≤α|u|. One of the fundamental problems for repetitive structures on strings is analyzing the number of substrings that have such structures in a string. Kolpakov et al. [CPM 2014] showed that O(α2n) upper bound and Ω(αn) lower bound on the maximum number of maximal α-gapped repeats in a string of length n, and the current best upper bound is 3(π2/6+5/2)αn by I and Köppl [TCS 2019]. Another interesting problem in this line of research is revealing the structures in well-known repetitive strings. In this paper, we investigate the maximal α-gapped repeats in a Fibonacci string. We show an interesting characterization of the form of an arm. More precisely, there are two possible cases in the form of an arm: Fibonacci arms and palindromic arms. By using these structures, we can obtain an upper bound of the maximum number of maximal α-gapped repeats in the k-th Fibonacci string. We can also show that the Fibonacci strings are a new example that contains Ω(αn) maximal α-gapped repeats. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： String theory

来源：评论

学校读者我要写书评

暂无评论

Reachability in Temporal Graphs Under Perturbation 50th

Reachability in Temporal Graphs Under Perturbation

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Enright, Jessica Larios-Jones, Laura Meeks, Kitty Pettersson, William School of Computing Science University of Glasgow Glasgow United Kingdom

ISBN: (纸本)9783031826696

Reachability and other path-based measures on temporal graphs can be used to understand spread of infection, information, and people in modelled systems. Due to delays and errors in reporting, temporal graphs derived from data are unlikely to perfectly reflect reality, especially with respect to the precise times at which edges appear. To reflect this uncertainty, we consider a model in which some number ζ of edge appearances may have their labels perturbed by ±δ for some δ. Within this model, we investigate temporal reachability and consider the problem of determining the maximum number of vertices any vertex can reach under these perturbations. We show this problem to be intractable in general but efficiently solvable when ζ is sufficiently large. We also give algorithms which solve this problem in several restricted settings. We complement this with some contrasting results concerning the complexity of related temporal eccentricity problems under perturbation. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

On Computational Completeness of Semi-Conditional Matrix Grammars 50th

On Computational Completeness of Semi-Conditional Matrix Gr...

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Fernau, Henning Kuppusamy, Lakshmanan Raman, Indhumathi Fachbereich 4 – Abteilung Informatikwissenschaften Universität Trier Trier54286 Germany School of Computer Science and Engineering VIT University Vellore632014 India Department of Computing Technologies SRM Institute of Science and Technology Kattankulathur Chennai603203 India

ISBN: (纸本)9783031826696

Matrix grammars are one of the first approaches ever proposed in regulated rewriting, prescribing that rules have to be applied in a certain order. In regulated rewriting, the most interesting case shows up when all rules are context-free. Typical descriptional complexity measures incorporate the number of nonterminals or the matrix length, i.e., the number of rules per matrix. When viewing matrices as program fragments, it becomes natural to consider additional applicability conditions for such matrices. Here, we focus on attaching a permitting and a forbidden string to every matrix in a matrix grammar. the matrix is applicable to a sentential form w only if the permitting string is a subword in w and the forbidden string is not a subword in w. We call such a grammar, where the application of a matrix is conditioned as described, a semi-conditional matrix grammar. We consider (1) the maximal lengths of permitting and forbidden strings, (2) the number of nonterminals, (3) the number of conditional matrices, (4) the maximal length of any matrix and (5) the number of conditional matrices with nonempty permitting and forbidden strings, as the resources (descriptional complexity measures) of a semi-conditional matrix grammar. We show that certain semi-conditional matrix grammar families defined by restricting resources can generate all recursively enumerable languages. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Context free grammars

来源：评论

学校读者我要写书评

暂无评论

Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints 50th

Tolerant Testing and Distance Estimation for Distributions...

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Roy, Sampriti Vasudev, Yadu Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India

ISBN: (纸本)9783031826962

We investigate tolerant testing and distance estimation problems in distribution testing when the amount of memory is limited. In particular, our aim is to provide a good estimate of the distance measure (in total variation distance) using constant memory words. though the problems are well understood in the standard access model with an Ω(nlogn) lower bound, it has not been explored under memory constraints. We propose algorithms that require O(nϵ7) queries for estimating distance to a known distribution and O(nϵ6) queries (where ϵ∈(0,1) is an error parameter) for estimating distance to uniformity that use only O(1) memory words. Our algorithms match the Ω(nϵ4) lower bound established by [19] in terms of the dependence on n. Additionally, we present an (ϵ,cϵ) tolerant closeness tester in terms of 2 distance for all c≥3, which requires O(n3mϵ2) samples and O(m) bits of memory for logn/ϵ4≤m≤n/ϵ2. Furthermore, we outline an O(n2ϵ12mϵ24) trade-off for (ϵ1,ϵ2) tolerant closeness testing problem (0121 distance, where logn≤m≤nlogn is the available memory in bits. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Distribution testing Property testing Streaming

来源：评论

学校读者我要写书评

暂无评论

Online b-Matching with Stochastic Rewards 50th

Online b-Matching with Stochastic Rewards

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Albers, Susanne Schubert, Sebastian Department of Computer Science Technical University of Munich Garching Germany

ISBN: (纸本)9783031826696

the b-matching problem is an allocation problem where the vertices on the left-hand side of a bipartite graph, referred to as servers, may be matched multiple times. In the setting with stochastic rewards, an assignment between an incoming request and a server turns into a match with a given success probability. Mehta and Panigrahi (FOCS 2012) introduced online bipartite matching with stochastic rewards, where each vertex may be matched once. the framework is equally interesting in graphs with vertex capacities. In Internet advertising, for instance, the advertisers seek successful matches with a large number of users. We develop (tight) upper and lower bounds on the competitive ratio of deterministic and randomized online algorithms, for b-matching with stochastic rewards. Our bounds hold for both offline benchmarks considered in the literature. As in prior work, we first consider vanishing probabilities. We show that no randomized online algorithm can achieve a competitive ratio greater than 1-1/e≈0.632, even for identical vanishing probabilities and arbitrary uniform server capacities. Furthermore, we conduct a primal-dual analysis of the deterministic StochasticBalance algorithm. We prove that it achieves a competitive ratio of 1-1/e, as server capacities increase, for arbitrary heterogeneous non-vanishing edge probabilities. this performance guarantee holds in a general setting where servers have individual capacities and for the vertex-weighted problem extension. To the best of our knowledge, this is the first result for StochasticBalance with arbitrary non-vanishing probabilities. We remark that our impossibility result implies in particular that, for the AdWords problem, no online algorithm can be better than (1-1/e)-competitive in the setting with stochastic rewards. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：