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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Asymmetric Traveling Salesman Path and Directed Latency Problems

Asymmetric Traveling Salesman Path and Directed Latency Prob...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Friggstad, Zachary Salavatipour, Mohammad R. Svitkina, Zoya Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada

ISBN: (纸本)9780898717013

We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nodes s and t, both problems ask to find an s-t path visiting all other nodes In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency problem, the objective is to minimize the sum of distances on this path from s to each node. Both of these problems are NP-hard The best known approximation algorithms for ATSPP had ratio O(log n) [7,9] until the very recent result that improves it to O(log n/ log log n) [3,9]. However, only a bound of O(root n) for the integrality gap of its lineal programming relaxation has been known. For directed latency, the best previously known approximation algorithm has a guarantee of O(n(1/2+epsilon)), for any constant epsilon > 0 [23] We present a new algorithm for the ATSPP problem that has approximation ratio of O(log n), but whose analysis also bounds the integrality gap of the standard LP relaxation of ATSPP by the same factor. This solves an open problem posed in [7]. We then pursue a deeper study of this LP and its variations and their use in approximating directed latency. Our second major result is an O(log n)approximation to the directed latency problem This also places an O(log n) bound on the integrality gap of a new LP relaxation of the latency problem that we introduce

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Coresets and Sketches for High Dimensional Subspace Approximation Problems

Coresets and Sketches for High Dimensional Subspace Approxim...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Feldman, Dan Monemizadeh, Morteza Sohler, Christian Woodruff, David P. Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel Univ Dortmund Dept Comp Sci Dortmund Germany IBM Corp Almaden Res Ctr San Jose CA 95120 USA

ISBN: (纸本)9780898717013

We consider the problem of approximating a set P of n points in R-d by a j-dimensional subspace under the l(p) measure, in which we wish to minimize the sum or l(p) distances from each point or P to this subspace More generally, the F-q(l(p))-subspace approximation problem asks for a j-subspace that in the sum of gal powers of l(p)-distances to this subspace, up to a multiplicative factor of (1 + epsilon) We develop techniques for subspace approximation, regression. and matrix approximation that can be used to deal with massive data sets in high dimensional spaces In particular, we develop coresets and sketches, i e small space representations that approximate the input point set P with respect to the subspace approximation problem. Our results are. A dimensionality reduction method that can be applied to F-q(l(p))-clustering and shape fitting problems, such as those in [8, 15] The first strong coreset for F-1(l(2))-subspace approximation in high-dimensional spaces, i e. of size polynomial in the dimension of the space coreset approximates the distances to any j-subspace (not lust the optimal one) A (1 + epsilon)-approximation algorithm for the j-dimensional F-1(l(2))-subspace approximation problem with running time nd(J/epsilon)(O(1)) + (n + d)2(poly(J/epsilon)) A streaming algorithm that maintains a coreset for the F-1(l(2))-subspace approximation problem and uses a space of d(2 root log n/epsilon(2)) (weighted) points Streaming algorithms for the above problems with bounded precision in the turnstile model, i e, when coordinates coordinates appear in an arbitrary older and undergo multiple updates We show that bounded precision can lead to further improvements We extend results of [7] for approximate linear regression, distances to subspace approximation, and optimal rank-J approximation, to error measures other than the Frobenius norm

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Testing Planarity of Partially Embedded Graphs

Testing Planarity of Partially Embedded Graphs

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Angelini, Patrizio Di Battista, Giuseppe Frati, Fabrizio Jelinek, Vit Kratochvil, Jan Patrignani, Maurizio Rutter, Ignaz Roma Tre Univ Dipartimento Informat & Automaz Rome Italy

ISBN: (纸本)9780898717013

We study the following problem Given a planar graph G and a planar drawing (embedding) of a subgraph of G, can such a drawing be extended to a planar drawing of the entire graph G? This problem fits the paradigm of extending a partial solution to a complete one which has been studied before in many different settings. Unlike many cases, in which the presence of a partial solution in the input makes hard an otherwise easy problem, we show that the planarity question remains polynomial-time solvable Our algorithm is based on several combinatorial lemmata which show that the planarity of partially embedded graphs meets the "on-cas" behaviour obvious necessary conditions for planarity ale also sufficient These conditions are expressed in terms of the interplay between (a) rotation schemes and containment relationships between cycles and (b) the decomposition of a graph into its connected, biconnected, and triconnected components. This implies that no dynamic programming is needed for a decision algorithm and that the elements of the decomposition can be processed independently. Further, by equipping the components of the decomposition with suitable data structures and by carefully splitting the problem into simpler subproblems, we improve our algorithm to reach linear-time complexity Finally, we consider several generalizations of the problem, e g minimizing the number of edges of the Partial embedding that need to be rerouted to extend it, and fugue that they are NP-hard Also, we show how our algorithm can be applied to solve related Graph Drawing problems

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Sharp kernel clustering algorithms and their associated Grothendieck inequalities

Sharp kernel clustering algorithms and their associated Grot...

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Khot, Subhash Naor, Assaf

ISBN: (纸本)9780898717013

In the kernel clustering problem we are given a (large) n x n symmetric positive semidefinite matrix A = (a(ij)) with Sigma(n)(i=1) Sigma(n)(j=1) a(ij) = 0 and a (small) k x k symmetric positive semidefinite matrix B = (b(ij)) The goal is to find a partition (S(1), ..., S(k)} of {1, n} which maximizes Sigma(k)(i=1) Sigma(k)(j=1) (Sigma(p, q)is an element of S(1) x S(1) a(pq)) b(ij) We design a polynomial time approximation algorithm that achieves an approximation ratio of R(B)(2)/C(B) where R(B) and C(B) are geometric parameters that depend only on the matrix 13, defined as follows if b(ij) = < v(i), v(j)> is the Gram matrix representation of B lot some v(1), v(k) is an element of R(k) then R(B) is the minimum radius of a Euclidean ball containing the points {v(1), ..., v(k)} The parameter C(B) is defined as the maximum over all measurable partitions {A(1), ..., A(k)} of R(k-1) the quantity Sigma(k)(i=1) Sigma(k)(j=1) b(ij) < z(i), z(j)>, where for i is an element of{1, ..., k} the vector z, is an element of R(k-1) is the Gaussian moment of A(i), i e z, =,1/(2 pi)((k-1)/2) integral A ie-||x||(2)(2)/2dx We also show that for eve!): epsilon> 0, achieving an approximation guarantee of (1 - epsilon) R(B)(2)/C(B) is Unique Games hard

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Sublinear Time Algorithms for Ulam Distance

Near-Optimal Sublinear Time Algorithms for Ulam Distance

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Andoni, Alexandr Nguyen, Huy L. Princeton Univ Ctr Computat Intractabil Princeton NJ 08544 USA

ISBN: (纸本)9780898717013

We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of length d and at edit distance R, our algorithm runs in time (O) over tilde (d/R + root d) and outputs a constant approximation to R. We also prove a matching lower bound (up to logarithmic terms). Both upper and lower bounds arc improvements over previous results from, respectively, [Andoni-Indyk-Krauthgamer, SODA'09] and [Batu-Ergun-Kilian-Magen-Raskhodnikova-Rubinfeld-Sami, STOC'03].

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Google's Auction for TV Ads 10

Google's Auction for TV Ads

引用

21st Annual ACM/SIAM Symposium on Discrete Algorithms

作者： Nisan, Noam Hebrew Univ Jerusalem Jerusalem Israel

This talk will describe the auction that Google uses for allocation and pricing of TV ads. The talk describes the actual system and puts it in proper theoretical context.

ISBN: (纸本)9780898717013

This talk will describe the auction that Google uses for allocation and pricing of TV ads. The talk describes the actual system and puts it in proper theoretical context.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (proceedings in applied mathematics) SIAM

引用

丛书名： proceedings in applied mathematics

2006年

作者： [美国] Robert Sedgewick

ISBN: (纸本)9780898716108

Workshops held in Miami, Florida, January 21, 2006. The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and applied mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Nonlinear Partial Differential Equations and Applications

引用

丛书名： proceedings of Symposia in applied mathematics 65

2007年

作者： L. L. Bonilla L. L. Bonilla A. Carpio J. M. Vega S. Venakides

ISBN: (纸本)9780821842119

The articles of this book are written by leading experts in partial differential equations and their applications, who present overviews here of recent advances in this broad area of mathematics. The formation of shocks in fluids, modern numerical computation of turbulence, the breaking of the Einstein equations in a vacuum, the dynamics of defects in crystals, effects due to entropy in hyperbolic conservation laws, the Navier–Stokes and other limits of the Boltzmann equation, occupancy times for Brownian motion in a two dimensional wedge, and new methods of analyzing and solving integrable systems are some of this volume's subjects. The reader will find an exposition of important advances without a lot of technicalities and with an emphasis on the basic ideas of this field.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling and Simulation of Biological Networks

引用

丛书名： proceedings of Symposia in applied mathematics 64

2007年

作者： Reinhard C. Laubenbacher

ISBN: (纸本)9780821839645

It is the task of computational biology to help elucidate the unique characteristics of biological systems. This process has barely begun, and many researchers are testing computational tools that have been used successfully in other fields. Mathematical and statistical network modeling is an important step toward uncovering the organizational principles and dynamic behavior of biological networks. Undoubtedly, new mathematical tools will be needed, however, to meet this challenge. The workhorse of this effort at present comprises the standard tools from applied mathematics, which have proven to be successful for many problems. But new areas of mathematics not traditionally considered applicable are contributing other powerful tools. This volume is intended to introduce this topic to a broad mathematical audience. The aim is to explain some of the biology and the computational and mathematical challenges we are facing. The different chapters provide examples of how these challenges are met, with particular emphasis on nontraditional mathematical approaches. The volume features a broad spectrum of networks across scales, ranging from biochemical networks within a single cell to epidemiological networks encompassing whole cities. Chapter topics include phylogenetics and gene finding using tools from statistics and algebraic geometry, biochemical network inference using tools from computational algebra, control-theoretic approaches to drug delivery using differential equations, and interaction-based modeling and discrete mathematics applied to problems in population dynamics and epidemiology.

关键词： Scientific Computing Mathematical Modeling - Science

来源：评论

学校读者我要写书评

暂无评论

The Radon Transform, Inverse Problems, and Tomography

引用

丛书名： proceedings of symposia in applied mathematics.

2006年

作者： Gestur Olafsson and Eric Todd Quinto

ISBN: (纸本)9780821839300

Since their emergence in 1917, tomography and inverse problems remain active and important fields that combine pure and applied mathematics and provide strong interplay between diverse mathematical problems and applications. The applied side is best known for medical and scientific use, in particular, medical imaging, radiotherapy, and industrial non-destructive testing. Doctors use tomography to see the internal structure of the body or to find functional information, such as metabolic processes, noninvasively. Scientists discover defects in objects, the topography of the ocean floor, and geological information using X-rays, geophysical measurements, sonar, or other data. This volume, based on the lectures in the Short Course The Radon Transform and Applications to Inverse Problems at the American Mathematical Society meeting in Atlanta, GA, January 3–4, 2005, brings together articles on mathematical aspects of tomography and related inverse problems. The articles cover introductory material, theoretical problems, and practical issues in 3-D tomography, impedance imaging, local tomography, wavelet methods, regularization and approximate inverse, sampling, and emission tomography. All contributions are written for a general audience, and the authors have included references for further reading.

关键词： Statistics Radiology Diagnostic Imaging Waves Wave Mechanics Optics - General Miscellaneous Biotechnology Bioengineering mathematics - applied Mathematical Equations - Differential

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：