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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

129 篇 会议
14 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

87 篇 工学
- 81 篇 计算机科学与技术...
- 20 篇 软件工程
- 5 篇 信息与通信工程
- 3 篇 控制科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
80 篇 理学
- 80 篇 数学
- 8 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 化学
- 1 篇 系统科学
5 篇 管理学
- 4 篇 管理科学与工程(可...
- 4 篇 工商管理
- 1 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学

主题

13 篇 algorithms
6 篇 approximation al...
6 篇 polynomial appro...
5 篇 discrete fourier...
4 篇 computational ge...
3 篇 set theory
3 篇 graphic methods
3 篇 logarithm (log)
3 篇 logs
2 篇 computer science
2 篇 generating funct...
2 篇 lattices
2 篇 computational co...
2 篇 shortest vector ...
2 篇 trees (mathemati...
2 篇 average-case ana...
2 篇 planted clique
2 篇 mixtures
2 篇 optimization pro...
2 篇 discrete fourier...

机构

6 篇 rhein westfal th...
3 篇 university of wi...
3 篇 univ bonn res in...
2 篇 university of ca...
2 篇 rhein westfal th...
2 篇 university of ed...
2 篇 department of ma...
2 篇 univ bonn hausdo...
2 篇 univ calif berke...
2 篇 rhein westfal th...
2 篇 department of co...
2 篇 labri université...
2 篇 max planck inst ...
2 篇 inst for basic s...
2 篇 univ warwick ctr...
2 篇 technion israel ...
2 篇 cornell univ 107...
2 篇 univ montpellier...
2 篇 harvard john a p...
2 篇 ut austin austin...

作者

9 篇 csaba d. tóth
5 篇 adrian dumitresc...
3 篇 englert matthias
3 篇 agarwal pankaj k...
3 篇 servedio rocco a...
3 篇 tóth csaba d.
3 篇 grohe martin
2 篇 chan siu-on
2 篇 de anindya
2 篇 stephens-davidow...
2 篇 kapralov michael
2 篇 roughgarden tim
2 篇 michael kaufmann
2 篇 raghavendra pras...
2 篇 sharir micha
2 篇 wiederrecht seba...
2 篇 traub vera
2 篇 vöcking b
2 篇 diakonikolas ili...
2 篇 koch laura varga...

语言

145 篇 英文
1 篇 其他

检索条件"任意字段=13th Annual ACM/SIAM Symposium on Discrete Algorithms"

共 146 条记录，以下是51-60 订阅

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

详细简洁

排序：

Proceedings of the annual acm-siam symposium on discrete algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Alg...

引用

27th annual acm-siam symposium on discrete algorithms, SODA 2016

ISBN: (纸本)9781510819672

the proceedings contain 146 papers. the topics discussed include: locality-sensitive hashing without false negatives;new directions in nearest neighbor searching with applications to lattice sieving;phase transitions in group testing;tight bounds for the distribution-free testing of monotone conjunctions;designing networks with good equilibria under uncertainty;characterization of strongly stable matchings;learning and efficiency in games with dynamic population;on dynamic approximate shortest paths for planar graphs with worst case costs;error amplification for pairwise spanner lower bounds;on notions of distortion and an almost minimum spanning tree with constant average distortion;approximately efficient double auctions with strong budget balance;and interpolating between truthful and non-truthful mechanisms for combinatorial auctions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the annual acm-siam symposium on discrete algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Alg...

引用

27th annual acm-siam symposium on discrete algorithms, SODA 2016

ISBN: (纸本)9781510819672

关键词：

来源：评论

学校读者我要写书评

暂无评论

Partition constrained covering of a symmetric crossing supermodular function by a graph

Partition constrained covering of a symmetric crossing super...

引用

21st annual acm/siam symposium on discrete algorithms

作者： Bernath, Attila Grappe, Roland Szigeti, Zoltan Eotvos Lorand Univ Dept Operat Res Egervary Res Grp MTA ELTE Pazmeny Peter Setany 1-C H-1117 Budapest Hungary Univ Paris 13 Sorbonne Paris Cite LIPN CNRS UMR 7030 F-93430 Villetaneuse France UJF Grenoble INP CNRS Lab G SCOP F-38000 Grenoble France

ISBN: (纸本)9780898717013

Given a symmetric crossing super modular set function p on V and a partition P of V, we solve the problem of finding a graph with ground set V having edges only between the classes of P such that for every subset X of V the cut of the graph defined by X contains at least p(X) edges. the objective is to minimize the number of edges of the graph this problem is a common generalization of the global edge-connectivity augmentation of a graph with partition constraints, which was solved by Bang-Jensen, Gabow, Jordan and Szigeti [1] and the problem of covering a. symmetric crossing supermodular set function solved by Benezur and Frank [3] Our problem can be considered as an abstract form of the problem of global edge-connectivity augmentation of a hypergraph by a multipartite graph;which was earlier solved by the authors [5]

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Optimal Construction of Compressed Indexes for Highly Repetitive Texts 30

Optimal Construction of Compressed Indexes for Highly Repeti...

引用

30th annual acm-siam symposium on discrete algorithms (SODA)

作者： Kempa, Dominik Univ Helsinki Helsinki Inst Informat Technol HIIT Dept Comp Sci Helsinki Finland Univ Warwick Dept Comp Sci Coventry England Univ Warwick Ctr Discrete Math & its Applicat DIMAP Coventry England

ISBN: (纸本)9781611975482

We propose algorithms that, given the input string of length n over integer alphabet of size sigma, construct the Burrows{Wheeler transform (BWT), the permuted longest-common-prefix (PLCP) array, and the LZ77 parsing in O(n= log(sigma) n + r polylog n) time and working space, where r is the number of runs in the BWT of the input. these are the essential components of many compressed indexes such as compressed suffix tree, FM-index, and grammar and LZ77-based indexes, but also find numerous applications in sequence analysis and data compression. the value of r is a common measure of repetitiveness that is significantly smaller than n if the string is highly repetitive. Since just accessing every symbol of the string requires Omega(n/ log(sigma) n) time, the presented algorithms are time and space optimal for inputs satisfying the assumption n=r is an element of(polylog n) on the repetitiveness. For such inputs our result improves upon the currently fastest general algorithms of Belazzougui (STOC 2014) and Munro et al. (SODA 2017) which run in O(n) time and use O(n= log(sigma) n) working space. We also show how to use our techniques to obtain optimal solutions on highly repetitive data for other fundamental string processing problems such as: Lyndon factorization, construction of run-length compressed suffix arrays, and some classical \textbook" problems such as computing the longest substring occurring at least some fixed number of times.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Single-Source Unsplittable Flows in Planar Graphs 35

Single-Source Unsplittable Flows in Planar Graphs

引用

35th annual acm-siam symposium on discrete algorithms (SODA)

作者： Traub, Vera Koch, Laura Vargas Zenklusen, Rico Univ Bonn Res Inst Discrete Math Bonn Germany Univ Bonn Hausdorff Ctr Math Bonn Germany Swiss Fed Inst Technol Dept Math Zurich Switzerland

ISBN: (纸本)9781611977912

the single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single path. One of the most heavily studied SSUF objectives is to minimize the violation of some given arc capacities. A seminal result of Dinitz, Garg, and Goemans showed that, whenever a fractional flow exists respecting the capacities, then there is an unsplittable one violating the capacities by at most the maximum demand. Goemans conjectured a very natural cost version of the same result, where the unsplittable flow is required to be no more expensive than the fractional one. this intriguing conjecture remains open. More so, there are arguably no non-trivial graph classes for which it is known to hold. We show that a slight weakening of it (with at most twice as large violations) holds for planar graphs. Our result is based on a connection to a highly structured discrepancy problem, whose repeated resolution allows us to successively reduce the number of paths used for each terminal, until we obtain an unsplittable flow. Moreover, our techniques also extend to simultaneous upper and lower bounds on the flow values. this also affirmatively answers a conjecture of Morell and Skutella for planar SSUF.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the Nineteenth annual acm-siam symposium on discrete algorithms

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on D...

引用

19th annual acm-siam symposium on discrete algorithms

ISBN: (纸本)9780898716474

the proceedings contain 134 papers. the topics discussed include: delaunay graphs of point sets in the plane with respect to axis-parallel rectangles;maintaining deforming surface meshes;two-phase greedy algorithms for some classes of combinatorial linear programs;yet another algorithm for dense max cut: go greedy;computing large matchings fast;distributed broadcast in unknown radio networks;the power of memory in randomized broadcasting;competitive queue management for latency sensitive packets;a nearly linear time algorithm for the half integral disjoint paths packing;nondecreasing paths in a weighted graph or: how to optimally read a train schedule;graph balancing: a special case of scheduling unrelated parallel machines;on the connectivity of dynamic random geometric graphs;balls and bins with structure: balanced allocations on hypergraphs;improved algorithms for orienteering and related problems;and deterministic random walks on regular trees.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dimension-independent Sparse Fourier Transform 30

Dimension-independent Sparse Fourier Transform

引用

30th annual acm-siam symposium on discrete algorithms (SODA)

作者： Kapralov, Michael Velingker, Ameya Zandieh, Amir Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland Google Res Mountain View CA USA

ISBN: (纸本)9781611975482

the discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime depends only on the size N of the input vector, but not on the dimensionality of the input domain: FFT runs in time O(N logN) irrespective of whether the DFT in question is on Z(N) or Z(d)(n) for some d > 1, where N = n(d). the state of the art for Sparse FFT, i.e. the problem of computing the DFT of a signal that has at most k nonzeros in Fourier domain, is very different: all current techniques for sublinear time computation of Sparse FFT incur an exponential dependence on the dimension d in the runtime. In this paper we give the first algorithm that computes the DFT of a k-sparse signal in time poly(k;logN) in any dimension d, avoiding the curse of dimensionality inherent in all previously known techniques. Our main tool is a new class of filters that we refer to as adaptive aliasing filters: these filters allow isolating frequencies of a k-Fourier sparse signal using O(k) samples in time domain and O(k logN) runtime per frequency, in any dimension d. We also investigate natural average case models of the input signal: worst case support in Fourier domain with randomized values and random locations in Fourier domain with worst case signal values. Our techniques lead to an (O) over tilde (k(2)) time algorithm for the former and an (O) over tilde (kappa) time algorithm for the latter.

关键词： discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Computing the discrete Frechet Distance in Subquadratic Time

Computing the Discrete Frechet Distance in Subquadratic Time

引用

24th annual acm-siam symposium on discrete algorithms (SODA)

作者： Agarwal, Pankaj K. Ben Avraham, Rinat Kaplan, Haim Sharir, Micha Duke Univ Dept Comp Sci Box 90129 Durham NC 27708 USA Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel NYU Courant Inst Math Sci New York NY 10012 USA

ISBN: (纸本)9781611973105;9781611972511

the Frechet distance is a similarity measure between two curves A and B that takes into account the location and ordering of the points along the two curves: Informally, it is the minimum length of a leash required to connect a dog, walking along A, and its owner, walking along B, as they walk without backtracking along their respective curves from one endpoint to the other. the discrete Frechet distance replaces the dog and its owner by a pair of frogs that can only reside on n and m specific stones on the curves A and B, respectively. these frogs hop from one stone to the next without backtracking, and the discrete Frechet distance is the minimum length of a "leash" that connects the frogs and allows them to execute such a sequence of hops. It can be computed in quadratic time by a straightforward dynamic programming algorithm. We present the first subquadratic algorithm for computing the discrete Frechet distance between two sequences of points in the plane. Assuming m <= n, the algorithm runs in O(mn log log n/log n) time, in the standard RAM model, using O(n) storage. Our approach uses the geometry of the problem in a subtle way to encode legal positions of the frogs as states of a finite automaton.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the annual acm-siam symposium on discrete algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Alg...

引用

6th annual acm-siam symposium on discrete algorithms, SODA 1995

ISBN: (纸本)0898713498

the proceedings contain 70 papers. the topics discussed include: selecting the median;algorithms for graphic polymatroids and parametric s-sets;design of practical and provably good random number generators;a combinatorial algorithm for minimizing symmetric submodular functions;on the entropy of DNA: algorithms and measurements based on memory and rapid convergence;improved algorithms for protein motif recognition;from valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems;doing two-level logic minimization 100 times faster;on the statistical dependencies of coalesced hashing and their implications for both full and limited independence;efficient parallel computations for singular band matrices;chaining multiple-alignment fragments in sub-quadratic time;finding optimal edge-rankings of trees;dihedral bounds for mesh generation in high dimensions;approximating discrete collections via local improvements;randomized rounding without solving the linear program;finding subsets maximizing minimum structures;average-case analysis of off-line and on-line knapsack problems;Voronoi diagrams of lines in 3-space under polyhedral convex distance functions;and path optimization and near-greedy analysis for graph partitioning: an empirical study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Weisfeiler-Leman and Graph Spectra 34

Weisfeiler-Leman and Graph Spectra

引用

34th acm-siam annual symposium on discrete algorithms (SODA)

作者： Rattan, Gaurav Seppelt, Tim Rhein Westfal TH Aachen Aachen Germany

ISBN: (纸本)9781611977554

Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family of graphs which is provably weaker than isomorphism. In this paper, we study cospectrality in relation to another well-studied relaxation of isomorphism, namely k-dimensional Weisfeiler-Leman ( k-WL) indistinguishability. Cospectrality with respect to standard graph matrices such as the adjacency or the Laplacian matrix yields a strictly finer equivalence relation than 2-WL indistinguishability. We show that individualising one vertex plus running 1-WL already subsumes cospectrality with respect to all such graph matrices. Building on this result, we resolve an open problem of Furer (2010) about spectral invariants and strengthen a result of Godsil (1981) about commute distances. Looking beyond 2-WL, we devise a hierarchy of graph matrices generalising the adjacency matrix such that k-WL indistinguishability after a fixed number of iterations can be captured as a spectral condition on these matrices. Precisely, we provide a spectral characterisation of k-WL indistinguishability after d iterations, for k;d is an element of N. Our results can be viewed as characterisations of homomorphism indistinguishability over certain graph classes in terms of matrix equations. the study of homomorphism indistinguishability is an emerging field, to which we contribute by extending the algebraic framework of Mancinska and Roberson (2020) and Grohe et al. (2022).

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：