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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

137 篇 会议
60 册 图书

馆藏范围

188 篇 电子文献
16 种 纸本馆藏

日期分布

学科分类号

167 篇 理学
- 166 篇 数学
- 8 篇 生物学
- 6 篇 统计学（可授理学、...
- 2 篇 生态学
- 1 篇 物理学
- 1 篇 系统科学
150 篇 工学
- 142 篇 计算机科学与技术...
- 3 篇 软件工程
- 2 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 动力工程及工程热...
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 兵器科学与技术
- 1 篇 环境科学与工程（可...
9 篇 农学
- 1 篇 农业资源与环境
7 篇 管理学
- 7 篇 管理科学与工程(可...
6 篇 经济学
- 6 篇 应用经济学
1 篇 哲学
- 1 篇 哲学
1 篇 法学
- 1 篇 社会学

主题

15 篇 approximation al...
6 篇 data structures
6 篇 congresses.
5 篇 polynomial appro...
5 篇 graph theory
3 篇 computational co...
3 篇 probability dist...
3 篇 vector spaces
3 篇 computational ge...
3 篇 graphic methods
3 篇 linear programmi...
3 篇 costs
3 篇 game theory
3 篇 cryptography
3 篇 geometry
2 篇 数学
2 篇 literary collect...
2 篇 sorting
2 篇 proceedings
2 篇 landforms

机构

4 篇 max planck inst ...
3 篇 georgia inst tec...
3 篇 res org informat...
3 篇 ibm corp almaden...
3 篇 mit comp sci & a...
3 篇 university of wa...
3 篇 carnegie mellon ...
2 篇 cnrs inria lab i...
2 篇 mit ctr operat r...
2 篇 univ wisconsin d...
2 篇 univ michigan an...
2 篇 univ calif irvin...
2 篇 princeton univ d...
2 篇 princeton univer...
2 篇 york univ n york...
2 篇 cornell univ dep...
2 篇 max planck inst ...
2 篇 mcgill univ dept...
2 篇 harvard univ dep...
2 篇 univ toronto dep...

作者

4 篇 kawarabayashi ke...
4 篇 patrascu mihai
3 篇 sauerwald thomas
3 篇 woodruff david p...
3 篇 american mathema...
3 篇 kleinberg robert
3 篇 demaine erik d.
3 篇 symposium in app...
3 篇 gupta anupam
2 篇 mathieu claire
2 篇 rabani yuval
2 篇 talwar kunal
2 篇 chandrasekaran k...
2 篇 gamarnik david
2 篇 andoni alexandr
2 篇 saberi amin
2 篇 friedrich tobias
2 篇 bansal nikhil
2 篇 reed bruce
2 篇 robert sedgewick

语言

147 篇 英文
50 篇 中文

检索条件"丛书名=Proceedings in Applied Mathematics"

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

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

详细简洁

排序：

A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing

A quasi-polynomial time approximation scheme for Euclidean c...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Das, Aparna Mathieu, Claire Brown University-Computer Science United States

ISBN: (纸本)9780898717013

In the capacitated vehicle routing problem, introduced by Dantzig and Ramsei in 1959, we are given the locations of a. customers and a depot, along with a vehicle of capacity k, and, wish to find a minimum length collection of toms, each starting nom the depot and visiting at most k customers, whose union covets all the customers We give a quasi-polynomial time approximation scheme for the setting where the customers and the depot are on the plane, and distances are given by the Euclidean metric

关键词： Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

Solving MAX-r-SAT Above a Tight Lower Bound

Solving MAX-<i>r</i>-SAT Above a Tight Lower Bound

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Alon, Noga Gutin, Gregory Kim, Eun Jung Szeider, Stefan Yeo, Anders Tel Aviv Univ Sch Math IL-69978 Tel Aviv Israel Univ London Royal Holloway & Bedford New Coll Dept Comp Sci Egham TW20 0EX Surrey England Vienna Univ Technol A-1040 Vienna Austria

ISBN: (纸本)9780898717013

We present an exact algorithm that decides, for every fixed r >= 2 in time O(m) + 2(O)(k)(2) whether a given set of m clauses of size r admits a truth assignment that satisfies at least ((2(r) - 1)m + k)/2(r) clauses. Thus MAX-r-SAT is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound (1 - 2(-r))m. This solves an open problem of Mahajan, Raman and Sikdar (J Comput. System Sci., 75, 2009). Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent algebraically represented problem with O(k(2)) variables This is done by representing the instance as an appropriate polynomial, and by applying a probabilistic argument combined with some simple tools from Harmonic analysis to show that if the polynomial cannot be reduced to one of size O(k(2)), then there is a truth assignment satisfying the required number of clauses. Combining another probabilistic argument with tools from graph matching theory and signed graphs, we show that if an instance of MAX-2-SAT with m clauses has at least 3k variables after application of certain polynomial time reduction rules to it, then there is a truth assignment that satisfies at least (3m + k)/4 clauses We also outline how the fixed-parameter tractability result on MAX-r-SAT can be extended to a family of Boolean Constraint Satisfaction Problems.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Convergence, Stability, and Discrete Approximation of Laplace Spectra

Convergence, Stability, and Discrete Approximation of Laplac...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Dey, Tamal K. Ranjan, Pawas Wang, Yusu Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9780898717013

Spectral methods lid ye been widely used in a broad range of applications fields One important, object. involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed, a variety of work in graphics and geometric optimization uses the eigen-structures (i.e, the eigenvalues and eigenfunctions) of the Laplace operator Applications include mesh smoothing, compression, editing, shape segmentation, matching parameterization, and so on While the Laplace, operator is defined (mathematically) for a smooth domain, these applications often approximate a smooth manifold by a disci etc mesh The spectral structure of the manifold Laplacian is estimated from some discrete Laplace operator constructed horn this mesh In this paper, we study the important, question of how well the spectrum computed horn the disci etc mesh approximates the true spectrum of the manifold Laplacian We exploit. a recent. result CM mesh Laplacian and provide the first convergence result to elate the spectrum constructed from a general mesh (approximating an m-manifold embedded in R-d) with the true spectrum We also study how stable these eigenvalues and their discrete approximations are when the underlying manifold is per tin bed, and provide explicit bounds for the Laplacian spectra a of two "close" manifolds. as well as a convergence result for their discrete approximations Finally, we present, vat ions experimental results to demonstrate that these discrete spectra are both accurate and robust in practice

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

A Model of Computation for MapReduce

A Model of Computation for MapReduce

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Karloff, Howard Suri, Siddharth Vassilvitskii, Sergei AT and T Labs - Research United States Yahoo Research

ISBN: (纸本)9780898717013

In recent years die MapReduce framework has emerged as one of the most widely used parallel computing platforms for processing data on terabyte and petabyte scales Used daily at companies such as Yahoo(1), Google, Amazon, and Facebook, and adopted more recently by several universities, it allows for easy parallelization of data intensive computations over many machines One key feature of MapReduce that differentiates it from previous models of parallel computation is that it Interleaves sequential and parallel computation. We propose a model of efficient computation using the MapReduce paradigm Since Map Reduce is designed for computations over massive data sets, our model limits the number of machines and the memory per machine to be substantially sublinear in the size of the input On the other hand, we place very loose restrictions on the computational power of of any individual machine our model allows each machine to perform sequential computations in time polynomial in the size of the original input We compare Map Reduce to the PRAM model of computation We prove a simulation lemma showing that a large class of PRAM algorithms can be efficiently simulated via MapReduce The strength of Map Reduce. however, lies in the fact that It uses both sequential and parallel computation. We demonstrate how algorithms can take advantage of this fact to compute an MST of a dense graph in only two rounds, as opposed to Omega(log(n)) rounds needed in the standard PRAM model We show how to evaluate a wide class of functions using the MapReduce framework We conclude by applying this result to show how to compute sonic basic algorithmic problems such as undirected s-t connectivity in the MapReduce framework

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Deterministic Algorithms for the Lovasz Local Lemma

Deterministic Algorithms for the Lovasz Local Lemma

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Chandrasekaran, Karthekeyan Goyal, Navin Haeupler, Bernhard Georgia Inst Technol Atlanta GA 30332 USA MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9780898717013

The Lovasz Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that. depend on it. It is often used in combination with the probabilistic method for nonconstructive existence proofs A prominent application is to k-CNF formulas, where LLL implies that, if every clause in the formula shares variables with at most d <= 2(k)/e other clauses then such a formula has a satisfying assignment.. Recently, a. randomized algorithm to efficiently construct a. satisfying assignment was given by Moser [13]. Subsequently Moser and Tardos [14] gave a. randomized algorithm to construct the structures guaranteed by the LLL in a very general algorithmic framework We address the main problem left. open by Moser and Tardos of derandomizing these algorithms efficiently Specifically, for a k-CNF formula with m clauses and d <= 2(k/(1+epsilon))/e for some epsilon is an element of (0,1), we give an algorithm that finds a satisfying assignment in time (O) over tilde (m(2(1+1/epsilon))) This improves upon the deterministic algorithms of Moser and of Moser-Tardos with running times m(Omega(k2)) and m(Omega(k 1/epsilon)) which are superpolynomial for k = omega(1) and upon other previous algorithms which work only for d <= 2(k/16)/e Our algorithm works efficiently for the asymmetric version of LLL under the algorithmic *** of Moser and Tardos [14] and is also parallelizable, ie has polylogarithmic running time using polynomially many processors.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Self-improving Algorithms for Convex Hulls

Self-improving Algorithms for Convex Hulls

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Clarkson, Kenneth L. Mulzer, Wolfgang Seshadhri, C. IBM Corp Almaden Res Ctr San Jose CA 95120 USA Princeton Univ Dept Comp Sci Princeton NJ 08544 USA

ISBN: (纸本)9780898717013

We describe an algorithm for computing planar convex hulls in the self-improving model given a sequence I-1, I-2, of planar n-point sets, the tipper convex hull conv(I) of each set, I is desired We assume that there exists a probability distribution D on n-point sets, such that the inputs I-J are drawn independently according to D Furthermore, D is such that, the individual points are distributed independently of each other. In other words, the i'th point is distributed according to D-i. The D-i's can be arbitiary but are independent of each other The distribution V is not known to the algorithm in advance After a learning phase of n(epsilon) rounds, the expected tune to compute conv(I) is O(n + H(conv(I))) Here, H(conv(I)) is the entropy oh the output, which is a lower bound for the expected running time of any algebraic computation tree that computes the convex hull (More precisely, H(conv(I)) is the minimum entropy of any random variable that maps I to a description of conv(I) and to a labeling scheme that proves nonextremality for every point in I not on the hull) Our algorithm is thus asymptotically optimal for D.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Hardness Results for Homology Localization

Hardness Results for Homology Localization

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Chen, Chao Freedman, Daniel IST Austria Vienna Austria Vienna Univ Technol Vienna Austria Bar Ilan Univ Sch Engn Ramat Gan Israel

ISBN: (纸本)9780898717013

We address the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure We focus on the volume measure, that is, the 1-norm of a cycle Two main results are presented First we prove the problem NP-hard to approximate within any constant factor Second, we prove that for homology of dimension two or lughet, the problem is NP-hard to approximate even when the Betti number is O(1) A side effect is the inapproximability of the problem of computing the nonbounding cycle with the smallest volume, and computing cycles representing homology basis with the minimal total volume We also discuss other geometric measures (diameter and radius) and show their disadvantages in homology localization Our work is restricted to homology over the Z(2) field.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

Approximating the Crossing Number of Graphs Embeddable in An...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Hlineny, Petr Chimani, Markus Masaryk Univ Fac Informat Bot 68A Brno Czech Republic Univ Dortmund Fac Comp Sci D-44227 Dortmund Germany

ISBN: (纸本)9780898717013

The crossing number of a graph is the least, number of pairwise edge crossings in a drawing of the graph in the plane We provide an O(n log n) time constant factor approximation algorithm for the crossing number of a graph of bounded maximum degree which is "densely enough" embecklable in an at bitrary fixed orientable sin face Our approach combines some known tools with a powerful new lower bound on the crossing number of an embedded graph This result extends previous results that, gave such approximations in particular cases of projective, toroidal or apex graphs, it is a qualitative improvement over previously published algorithms that constructed low-crossing-number drawings of embeddable graphs without giving any approximation guarantees No constant factor approximation algorithms for the crossing number problem over comparably itch classes of graphs are known to date.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

The forest hiding problem - An illumination problem for maximal disk packings -

The forest hiding problem - An illumination problem for maxi...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Dumitrescu, Adrian Jiang, Minghui Univ Wisconsin Dept Comp Sci Milwaukee WI 53201 USA Utah State Univ Dept Comp Sci Logan UT 84322 USA

ISBN: (纸本)9780898717013

Let Omega be a disk of radius R in the plane. A set F of closed unit disks contained in Omega forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal i.e it is not possible to add another disk to F while maintaining the packing property. A point p is hidden within the "forest" defined by F if any ray with apex p intersects sonic disk of F that is, a person standing at p can hide without being seen from outside the forest We show that, if the radius R of Omega is large enough, one can find a hidden point for any maximal packing of unit disks in Omega This proves a conjecture of Joseph Mitchell. We also present an O(n(5/2) log n)-time algorithm that, given a forest with n (not necessarily congruent) disks, computes the boundary illumination map of all disks in the forest.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Region growing for multi-route cuts

Region growing for multi-route cuts

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Barman, Siddharth Chawla, Shuchi Univ Wisconsin Dept Comp Sci Madison WI 53706 USA

ISBN: (纸本)9780898717013

We study a number of multi-route cut problems given a graph G = (V, E) and connectivity thresholds k((u,v)) on pans of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between every pair (u, v) to strictly below its given threshold. These problems arise in the context of reliability in communication networks. They are natural generalizations of traditional minimum cut problems where the thresholds are either 1 (we want to completely separate the pair) or infinity (we don't care about the connectivity for the pair) We provide the first non-trivial approximations to a number of variants of the problem including for both node-disjoint and edge-disjoint connectivity thresholds. A main contribution of our work is an extension of the region growing technique for approximating minimum multicuts to the multi-route setting. When the connectivity thresholds are either 2 or infinity (the "2-route cut" case), we obtain polylogarithmic approximations while satisfying the thresholds exactly. For arbitrary connectivity thresholds this approach leads to bicriteria approximations where we approximately satisfy the thresholds and approximately minimize the cost. We present a number of different algorithms achieving different cost-connectivity tradeoffs

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：