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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

73 篇 会议
11 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

57 篇 工学
- 53 篇 计算机科学与技术...
- 10 篇 软件工程
- 3 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 水利工程
41 篇 理学
- 41 篇 数学
- 4 篇 统计学（可授理学、...
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学

主题

10 篇 algorithms
5 篇 discrete fourier...
3 篇 generating funct...
3 篇 logarithm (log)
3 篇 logs
3 篇 discrete mathema...
2 篇 computer science
2 篇 approximation al...
2 篇 average-case ana...
2 篇 mixtures
2 篇 analysis of algo...
2 篇 set theory
2 篇 optimization pro...
2 篇 discrete fourier...
2 篇 dependence
2 篇 smoothed analysi...
2 篇 mellin transform
2 篇 directed graphs
2 篇 analytic combina...
2 篇 dynamic programm...

机构

3 篇 univ bonn res in...
2 篇 rhein westfal th...
2 篇 university of ed...
2 篇 univ bonn hausdo...
2 篇 department of co...
2 篇 max planck inst ...
2 篇 inst for basic s...
2 篇 univ warwick ctr...
2 篇 univ montpellier...
2 篇 univ warwick dep...
2 篇 stanford univ st...
2 篇 natl & kapodistr...
1 篇 columbia univers...
1 篇 department of el...
1 篇 school of comput...
1 篇 univ southern ca...
1 篇 inst. discrete m...
1 篇 natl inst inform...
1 篇 technische unive...
1 篇 ctr wiskunde & i...

作者

3 篇 diakonikolas ili...
2 篇 chan siu-on
2 篇 stephens-davidow...
2 篇 kapralov michael
2 篇 wiederrecht seba...
2 篇 traub vera
2 篇 vöcking b
2 篇 czumaj artur
2 篇 thilikos dimitri...
2 篇 vygen jens
2 篇 giannopoulou arc...
2 篇 agarwal pankaj k...
2 篇 indyk piotr
2 篇 siu-on chan
2 篇 beier r
2 篇 servedio rocco a...
2 篇 piotr indyk
1 篇 racke harald
1 篇 huacheng yu
1 篇 halldorsson magn...

语言

83 篇 英文
1 篇 其他
1 篇 中文

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

共 85 条记录，以下是11-20 订阅

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

详细简洁

排序：

Proceedings of the annual acm-siam symposium on discrete algorithms

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

引用

29th annual acm-siam symposium on discrete algorithms, SODA 2018

ISBN: (纸本)9781611975031

the proceedings contain 180 papers. the topics discussed include: dynamic algorithms for graph coloring;incremental DFS algorithms: a theoretical and experimental study;decremental transitive closure and shortest paths for planar digraphs and beyond;polycubes with small perimeter defect;the classical complexity of boson sampling;race detection and reachability in nearly series-parallel DAGs;the complexity of independent set reconfiguration on bipartite graphs;metric violation distance: hardness and approximation;a submodular measure and approximate Gomory-Hu theorem for packing odd trails;and minor-matching hypertree width.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Communication Complexity of discrete Fair Division 30

Communication Complexity of Discrete Fair Division

引用

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

作者： Plaut, Benjamin Roughgarden, Tim Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781611975482

We initiate the study of the communication complexity of fair division with indivisible goods. We focus on some of the most well-studied fairness notions (envy-freeness, proportionality, and approximations thereof) and valuation classes (submodular, subadditive and unrestricted). Within these parameters, our results completely resolve whether the communication complexity of computing a fair allocation (or determining that none exist) is polynomial or exponential (in the number of goods), for every combination of fairness notion, valuation class, and number of players, for both deterministic and randomized protocols.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the annual acm-siam symposium on discrete algorithms

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

引用

28th annual acm-siam symposium on discrete algorithms, SODA 2017

ISBN: (纸本)9781611974782

the proceedings contain 181 papers. the topics discussed include: a framework for similarity search with space-time tradeoffs using locality-sensitive filtering;LSH forest: practical algorithms made theoretical;faster approximation schemes for the two-dimensional knapsack problem;split packing: an algorithm for packing circles with optimal worst-case density;local search for max-sum diversification;maximum scatter tsp in doubling metrics;exploring an infinite space with finite memory scouts;parameter-free locality sensitive hashing for spherical range reporting;distance sensitive bloom filters without false negatives;optimal approximate polytope membership;and massively-parallel similarity join, edge-isoperimetry, and distance correlations on the hypercube.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Polycubes with Small Perimeter Defect 29

Polycubes with Small Perimeter Defect

引用

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

作者： Asinowski, Andrei Barequet, Gill Zheng, Yufei Vienna Univ Technol Inst Discrete Math & Geometry A-1040 Vienna Austria Technion Israel Inst Technol Dept Comp Sci IL-3200003 Haifa Israel

A polycube is a face-connected set of cubical cells on Z(3). To-date, no formulae enumerating polycubes by volume (number of cubes) or perimeter (number of empty cubes neighboring the polycube) are known. We present a... 详细信息

ISBN: (纸本)9781611975031

关键词： Polycubes linear recurrence generating functions

来源：评论

学校读者我要写书评

暂无评论

Approaching 3/2 for the s-t-path TSP 29

Approaching 3/2 for the <i>s</i>-<i>t</i>-path TSP

引用

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

作者： Traub, Vera Vygen, Jens Univ Bonn Res Inst Discrete Math Bonn Germany

ISBN: (纸本)9781611975031

We show that there is a polynomial-time algorithm with approximation guarantee 3/2 + epsilon for the s-t-path TSP, for any fixed epsilon > 0. It is well known that Wolsey's analysis of Christofides' algorithm also works for the s-t-path TSP with its natural LP relaxation except for the narrow cuts ( in which the LP solution has value less than two). A fixed optimum tour has either a single edge in a narrow cut ( then call the edge and the cut lonely) or at least three ( then call the cut busy). Our algorithm "guesses" ( by dynamic programming) lonely cuts and edges. then we partition the instance into smaller instances and strengthen the LP, requiring value at least three for busy cuts. By setting up a k-stage recursive dynamic program, we can compute a spanning tree (V, S) and an LP solution y such that (1/2 + O(2(-k)))y is in the T-join polyhedron, where T is the set of vertices whose degree in S has the wrong parity.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

discrete Choice, Permutations, and Reconstruction 29

Discrete Choice, Permutations, and Reconstruction

引用

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

作者： Chierichetti, Flavio Kumar, Ravi Tomkins, Andrew Sapienza Univ Rome Rome Italy Google Mountain View CA USA

ISBN: (纸本)9781611975031

In this paper we study the well-known family of Random Utility Models, developed over 50 years ago to codify rational user behavior in choosing one item from a finite set of options. In this setting each user draws i.i.d. from some distribution a utility function mapping each item in the universe to a real-valued utility. the user is then offered a subset of the items, and selects the one of maximum utility. A MAX-DIST oracle for this choice model takes any subset of items and returns the probability (over the distribution of utility functions) that each will be selected. A discrete choice algorithm, given access to a MAX-DIST oracle, must return a function that approximates the oracle. We show three primary results. First, we show that any algorithm exactly reproducing the oracle must make exponentially many queries. Second, we show an equivalent representation of the distribution over utility functions, based on permutations, and show that if this distribution has support size k, then it is possible to approximate the oracle using O(nk) queries. Finally, we consider settings in which the subset of items is always small. We give an algorithm that makes less than n((1 - epsilon/2)K) queries, each to sets of size at most (1 - epsilon/2) K, in order to approximate the MAX-DIST oracle on every set of size vertical bar T vertical bar <= K with statistical error at most epsilon. In contrast, we show that any algorithm that queries for subsets of size 2(O)(root log n) must make maximal statistical error on some large sets.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Testing Conditional Independence of discrete Distributions 2018

Testing Conditional Independence of Discrete Distributions

引用

50th annual acm SIGACT symposium on the theory of Computing (STOC)

作者： Canonne, Clement L. Diakonikolas, Ilias Kane, Daniel M. Stewart, Alistair Stanford Univ Stanford CA 94305 USA Univ Southern Calif Los Angeles CA USA Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781450355599

We study the problem of testing conditional independence for discrete distributions. Specifically, given samples from a discrete random variable (X, Y, Z) on domain [Lambda(1)] x [Lambda(2)] x [n], we want to distinguish, with probability at least 2/3, between the case that X and Y are conditionally independent given Z from the case that (X, Y, Z) is epsilon-far, in l(1)-distance, from every distribution that has this property. Conditional independence is a concept of central importance in probability and statistics with a range of applications in various scientific domains. As such, the statistical task of testing conditional independence has been extensively studied in various forms within the statistics and econometrics communities for nearly a century. Perhaps surprisingly, this problem has not been previously considered in the framework of distribution property testing and in particular no tester with sublinear sample complexity is known, even for the important special case that the domains of X and Y are binary. the main algorithmic result of this work is the first conditional independence tester with sublinear sample complexity for discrete distributions over [Lambda(1)] x [Lambda(2)] x [n]. To complement our upper bounds, we prove information-theoretic lower bounds establishing that the sample complexity of our algorithm is optimal, up to constant factors, for a number of settings. Specifically, for the prototypical setting when Lambda(1), Lambda(2) = 0(1), we show that the sample complexity of testing conditional independence (upper bound and matching lower bound) is theta (max (n(1/2)/epsilon(2), min(n(7/8)/epsilon, n(6/7)/epsilon(8/7)))) To obtain our tester, we employ a variety of tools, including (1) a suitable weighted adaptation of the "flattening" technique, and (2) the design and analysis of an optimal (unbiased) estimator for the following statistical problem of independent interest: Given a degree-d polynomial Q : R-n -> R and sample access to a d

关键词： Distribution testing property testing probability distributions conditional independence discrete distributions sublinear algorithms hypothesis testing

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：