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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是21-30 订阅

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

详细简洁

排序：

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reordering Buffers with Logarithmic Diameter Dependency for Trees 28

Reordering Buffers with Logarithmic Diameter Dependency for ...

引用

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

作者： Englert, Matthias Racke, Harald Univ Warwick Dept Comp Sci Coventry W Midlands England Univ Warwick Ctr Discrete Math & Its Applicat DIMAP Coventry W Midlands England Tech Univ Munich Dept Informat Munich Germany

ISBN: (纸本)9781611974782

In the reordering buffer problem a sequence of items located in a metric space arrive online, and have to be processed by a single server moving within the metric space. At any point in time, the first k still unprocessed items from the sequence are available for processing and the server has to select one of these items and process it by visiting its location. the goal is to process all items while minimizing the total distance the server moves. Englert, Racke, Westermann (STOC'07) gave a deterministic O(D . log k)-competitive online algorithm for weighted tree metrics with hop-diameter D. We improve the analysis of this algorithm and significantly improve the dependency on D. Specifically, we show that the algorithm is in fact O(log D+log k)-competitive. Our analysis is quite robust. Even when an optimal algorithm, to which we compare the online algorithm, is allowed to choose between the first h > k unprocessed items, the online algorithm is still O(h . (log D+log h)/k)competitive. For h = (1 + epsilon) . k, with constant epsilon > 0, this is optimal. Our results also imply better competitive ratio for general metric spaces, improving the randomized O(log n . log(2) k) result for n-point metric spaces from STOC'07 to O(log n . log k).

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Reordering Buffers with Logarithmic Diameter Dependency for Trees 17

Reordering Buffers with Logarithmic Diameter Dependency for ...

引用

annual acm-Society for Industrial and Applied Mathmatics symposium on discrete algorithms

作者： Matthias Englert Harald Racke Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP) University of Warwick Department of Informatics Technical University Munich

ISBN: (纸本)9781510836358

In the reordering buffer problem a sequence of items located in a metric space arrive online, and have to be processed by a single server moving within the metric space. At any point in time, the first k still unprocessed items from the sequence are available for processing and the server has to select one of these items and process it by visiting its location. the goal is to process all items while minimizing the total distance the server moves. Englert, Racke, Westermann (STOC'07) gave a deterministic O(D·log k)-competitive online algorithm for weighted tree metrics with hop-diameter D. We improve the analysis of this algorithm and significantly improve the dependency on D. Specifically, we show that the algorithm is in fact O(log D+log k)-competitive. Our analysis is quite robust. Even when an optimal algorithm, to which we compare the online algorithm, is allowed to choose between the first h > k unprocessed items, the online algorithm is still O(h·(log D+log h)/k)-competitive. For h = (1 + ε)·k, with constant ε > 0, this is optimal. Our results also imply better competitive ratio for general metric spaces, improving the randomized O(log n · log~2 k) result for n-point metric spaces from STOC'07 to O(log n·log k).

关键词： metric space Servers algorithms Optimization algorithms DEPENDENCE analysis of algorithm Logarithmic

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the annual acm-siam symposium on discrete algorithms

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

引用

26th annual acm-siam symposium on discrete algorithms, SODA 2015

the proceedings contain 135 papers. the topics discussed include: approximating independent sets in sparse graphs;spider covers for prize-collecting network activation problem;on survivable set connectivity;a note on the ring loading problem;new approximation schemes for unspittable flow on a path;welfare maximization with production costs: a primal dual approach;pricing online decisions: beyond actions;on the complexity of computing an equilibrium in combinatorial actions;combinatorial actions via posted prices;minimum forcing sets for miura patterns;universal computation with arbitrary polyomino tiles in non-cooperative self-assembly;efficient and robust persistent homology for measures;zigzag persistence via reflections and transpositions;and more applications of the polynomial method in algorithm design.

关键词：

来源：评论

学校读者我要写书评

暂无评论

discrete Gaussian sampling reduces to CVP and SVP 27

Discrete Gaussian sampling reduces to CVP and SVP

引用

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

作者： Stephens-Davidowitz, Noah New York University United States

ISBN: (纸本)9781510819672

the discrete Gaussian D⌊-t,s is the distribution that assigns to each vector x in a shifted lattice ⌊ - t probability proportional to e-π||x||2/s2 It has long been an important tool in the study of lattices. More recently, algorithms for discrete Gaussian sampling (DGS) have found many applications in computer science. In particular, polynomial-time algorithms for DGS with very high parameters s have found many uses in cryptography and in reductions between lattice problems. And, in the past year, Aggar-wal, Dadush, Regev, and Stephens-Davidowitz showed 2n+o(n)-time algorithms for DGS with a much wider range of parameters and used them to obtain the current fastest known algorithms for the two most important lattice problems, the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). Motivated by its increasing importance, we investigate the complexity of DGS itself and its relationship to CVP and SVP. Our first result is a polynomial-time dimension-preserving reduction from DGS to CVP. there is a simple reduction from CVP to DGS, so this shows that DGS is equivalent to CVP. Our second result, which we find to be more surprising, is a polynomial-time dimension-preserving reduction from centered DGS (the important special case when t = 0) to SVP. In the other direction, there is a simple reduction from 7-approximate SVP for any γ = ω(√n/logn), and we present some (relatively weak) evidence to suggest that this might be the best achievable approximation factor. © (2016) by siam: Society for Industrial and Applied Mathematics.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform 27

Nearly optimal deterministic algorithm for sparse Walsh-Hada...

引用

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

作者： Cheraghchi, Mahdi Indyk, Piotr Department of Computing Imperial College London United Kingdom MIT Computer Science and Artificial Intelligence Laboratory CambridgeMA02139 United States

ISBN: (纸本)9781510819672

For every fixed constant α > 0, we design an algorithm for computing the k-sparse Walsh-Hadamard transform (i.e., discrete Fourier Transform over the Boolean cube) of an iV-dimensional vector x ∈ N in time k1+α(log N)°(1) Specifically, the algorithm is given query access to x and computes a k-sparse x ∈ .N satisfying ||x-◯||1 ≤ c||◯ - Hk(◯)\\1, for an absolute constant c > 0, where x is the transform of x and Hk(x) is its best k-sparse approximation. Our algorithm is fully deterministic and only uses non-adaptive queries to x (i.e., all queries are determined and performed in parallel when the algorithm starts). An important technical tool that we use is a construction of nearly optimal and linear lossless condensers which is a careful instantiation of the GUV condenser (Guruswami, Umans, Vadhan, Jacm 2009). Moreover, we design a deterministic and non-adaptive l1/l1 compressed sensing scheme based on general lossless condensers that is equipped with a fast reconstruction algorithm running in time k1+α(logN)O(1) (for the GUV-based condenser) and is of independent interest. Our scheme significantly simplifies and improves an earlier expander-based construction due to Berinde, Gilbert, Indyk, Karloff, Strauss (Allerton 2008). Our methods use linear lossless condensers in a black box fashion;therefore, any future improvement on explicit constructions of such condensers would immediately translate to improved parameters in our framework (potentially leading to k(log N)(1) reconstruction time with a reduced exponent in the poly-logarithmic factor, and eliminating the extra parameter α). By allowing the algorithm to use randomness, while still using non-adaptive queries, the running time of the algorithm can be improved to Ō(k log3 N).

关键词： discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Directed multicut is W-hard, even for four terminal pairs 16

Directed multicut is W-hard, even for four terminal pairs

引用

annual acm-Society for Industrial and Applied Mathmatics symposium on discrete algorithms

作者： Marcin Pilipczuk Magnus Wahlstrom University of Warsaw Royal Holloway University of London

ISBN: (纸本)9781510819672

We prove that Multicut in directed graphs, parameterized by the size of the cutset, is W[1]-hard and hence unlikely to be fixed-parameter tractable even if restricted to instances with only four terminal pairs. this negative result almost completely resolves one of the central open problems in the area of parameterized complexity of graph separation problems, posted originally by Marx and Razgon [siam J. Comput. 43(2):355-388 (2014)], leaving only the case of three terminal pairs open. the case of two terminal pairs was shown to be FPT by Chitnis et al. [siam J. Comput. 42(4):1674-1696 (2013)]. Our gadget methodology also allows us to prove W[1]-hardness of the Steiner Orientation problem parameterized by the number of terminal pairs, resolving an open problem of Cygan, Kortsarz, and Nutov [siam J. discrete Math. 27(3):1503-1513 (2013)].

关键词： multicut less-favoured region directed graphs parameterization iodine Device Terminal discrete mathematics

来源：评论

学校读者我要写书评

暂无评论

discrete Gaussian Sampling Reduces to CVP and SVP 16

Discrete Gaussian Sampling Reduces to CVP and SVP

引用

annual acm-Society for Industrial and Applied Mathmatics symposium on discrete algorithms

作者： Noah Stephens-Davidowitz New York University

ISBN: (纸本)9781510819672

the discrete Gaussian D_(L-t,s) is the distribution that assigns to each vector x in a shifted lattice L - t probability proportional to e~(-π‖x‖~2/s~2). It has long been an important tool in the study of lattices. More recently, algorithms for discrete Gaussian sampling (DGS) have found many applications in computer science. In particular, polynomialtime algorithms for DGS with very high parameters s have found many uses in cryptography and in reductions between lattice problems. And, in the past year, Aggarwal, Dadush, Regev, and Stephens-Davidowitz showed 2~(n+o(n))-time algorithms for DGS with a much wider range of parameters and used them to obtain the current fastest known algorithms for the two most important lattice problems, the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). Motivated by its increasing importance, we investigate the complexity of DGS itself and its relationship to CVP and SVP. Our first result is a polynomial-time dimension-preserving reduction from DGS to CVP. there is a simple reduction from CVP to DGS, so this shows that DGS is equivalent to CVP. Our second result, which we find to be more surprising, is a polynomial-time dimension-preserving reduction from centered DGS (the important special case when t = 0) to SVP. In the other direction, there is a simple reduction from g-approximate SVP for any γ = Ω({the square root of}(n/log n)), and we present some (relatively weak) evidence to suggest that this might be the best achievable approximation factor.

关键词： DiGeorge Syndrome COP protocol 2 SVP computer science

来源：评论

学校读者我要写书评

暂无评论

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform 16

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hada...

引用

annual acm-Society for Industrial and Applied Mathmatics symposium on discrete algorithms

作者： Mahdi Cheraghchi Piotr Indyk Department of Computing Imperial College London MIT Computer Science and Artificial Intelligence Laboratory

ISBN: (纸本)9781510819672

For every fixed constant α > 0, we design an algorithm for computing the k-sparse Walsh-Hadamard transform (i.e., discrete Fourier Transform over the Boolean cube) of an N-dimensional vector x ∈ R~N in time k~(1+α)(logN)~(O(1)). Specifically, the algorithm is given query access to x and computes a k-sparse ～x ∈ R~N satisfying ‖x - x‖1 ≤ ‖x - H_k(x)‖1, for an absolute constant c > 0, where x is the transform of x and H_k(x) is its best k-sparse approximation. Our algorithm is fully deterministic and only uses non-adaptive queries to x (i.e., all queries are determined and performed in parallel when the algorithm starts). An important technical tool that we use is a construction of nearly optimal and linear lossless condensers which is a careful instantiation of the GUV condenser (Guruswami, Umans, Vadhan, Jacm 2009). Moreover, we design a deterministic and non-adaptive l_1/l_1 compressed sensing scheme based on general lossless condensers that is equipped with a fast reconstruction algorithm running in time k~(1+α)(logN)~(O(1)) (for the GUV-based condenser) and is of independent interest. Our scheme significantly simplifies and improves an earlier expander-based construction due to Berinde, Gilbert, Indyk, Karloff, Strauss (Allerton 2008). Our methods use linear lossless condensers in a black box fashion; therefore, any future improvement on explicit constructions of such condensers would immediately translate to improved parameters in our framework (potentially leading to k(logN)~(O(1)) reconstruction time with a reduced exponent in the poly-logarithmic factor, and eliminating the extra parameter α). By allowing the algorithm to use randomness, while still using non-adaptive queries, the running time of the algorithm can be improved to ～O(k log~3 N).

关键词： Condensers mechanical heart valve algorithms Hadamard transform Lossless Transform deterministic algorithms discrete Fourier transform deterministic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：