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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

13 篇 会议

馆藏范围

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

日期分布

学科分类号

13 篇 理学
- 12 篇 数学
- 5 篇 统计学（可授理学、...
- 1 篇 物理学
10 篇 工学
- 10 篇 计算机科学与技术...
- 8 篇 软件工程
- 1 篇 电子科学与技术（可...
- 1 篇 信息与通信工程

主题

5 篇 algorithms
2 篇 approximation th...
1 篇 theorem proving
1 篇 computational ge...
1 篇 graph theory
1 篇 parallel process...
1 篇 polynomials
1 篇 combinatorial ma...

机构

1 篇 dept. of informa...
1 篇 indian institute...
1 篇 mit laboratory f...
1 篇 max-planck-inst....
1 篇 department of co...
1 篇 nec research pri...
1 篇 cwi amsterdam
1 篇 school of comput...
1 篇 department of co...
1 篇 dip. di matemati...
1 篇 bell labs 600 mo...
1 篇 sch. of technol....
1 篇 department of co...
1 篇 inria sophia-ant...
1 篇 mit lab. for com...
1 篇 carnegie mellon ...
1 篇 informatica la s...
1 篇 department of co...
1 篇 department of co...
1 篇 elec. eng. and c...

作者

2 篇 bǎdoiu mihai
1 篇 clarkson kenneth...
1 篇 newman ilan
1 篇 cryan mary
1 篇 ergün funda
1 篇 funke stefan
1 篇 bespamyatnikh se...
1 篇 srinivasan aravi...
1 篇 shparlinski igor
1 篇 radhakrishnan ja...
1 篇 yu xingxing
1 篇 dubhashi devdatt
1 篇 müller haiko
1 篇 rubinfeld ronitt
1 篇 könemann jochen
1 篇 czumaj artur
1 篇 lipton richard
1 篇 panconesi alessa...
1 篇 sohler christian
1 篇 stougie leen

语言

13 篇 英文

检索条件"任意字段=Configuralble Computing: Technology and Applications"

共 13 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of SPIE: Configurable computing: technology and applications

Proceedings of SPIE: Configurable Computing: Technology and ...

引用

configuralble computing: technology and applications

This Volume 3526 of the conference proceedings contains 29 papers. Topics discussed include configurable computing technology and applications, image processing, applications development, architectures, digital signal... 详细信息

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Unconditional proof of tightness of Johnson bound

Unconditional proof of tightness of Johnson bound

引用

configuralble computing: technology and applications

作者： Guruswami, Venkatesan Shparlinski, Igor Department of Computer Science University of Washington Seattle WA 98195 United States Department of Computing Macquarie University North Ryde NSW 2109 Australia

A study was performed to prove a slightly weaker bound on Lpoly(δ) without making any number-theoretic assumption. It was shown that Lpoly(δ&leJ(delta;)+γ0 for a very small absolute constant γ.

关键词： Theorem proving

来源：评论

学校读者我要写书评

暂无评论

computing homotopic shortest paths in the plane

Computing homotopic shortest paths in the plane

引用

configuralble computing: technology and applications

作者： Bespamyatnikh, Sergei Department of Computer Science University of Texas at Dallas Box 830688 Richardson TX 75083 United States

We address the problem of computing homotopic shortest paths in presence of obstacles in the plane. The problems on homotopy of the paths received attention very recently [3, 8]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [8]. The algorithm for non-simple paths achieves O(log2 n) time per output vertex which is an improvement by a factor of O(n/log2 n) of the previous algorithm [13] where n is the number of obstacles.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

computing strongly connected components in a linear number of symbolic steps

Computing strongly connected components in a linear number o...

引用

configuralble computing: technology and applications

作者： Gentilini, Raffaella Piazza, Carla Policriti, Alberto Dip. di Matematica e Informatica Università di Udine Via Le Scienze 206 33100 Udine Italy Italy

We present an algorithm that computes in a linear number of symbolic steps (O(|V|)) the strongly connected components (sccs) of a graph G = represented by an Ordered Binary Decision Diagram (OBDD). This result matches the complexity of the (celebrated) Tarjan's algorithm operating on explicit data structures. To date, the best algorithm for the above problem works in Θ(|V|log|V|) symbolic steps ([BGS00]).

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for embedding metrics into a two-dimensional space

Approximation algorithm for embedding metrics into a two-dim...

引用

configuralble computing: technology and applications

作者： BǍdoiu, Mihai MIT Lab. for Computer Science 545 Technology Square NE43-371 Cambridge MA 02139-3594 United States

In this paper, we present a polynomial-time approximation algorithm for computing an embedding of an arbitrary metric into a two-dimensional space. The algorithm finds an embedding whose additive distortion is at most cΕ*, where Ε* is the smallest additive distortion possible and c is an absolute constant. To our knowledge, this is the first result of this type, i.e., it gives an algorithm that finds (approximately) optimal embedding of a given distance matrix into a fixed d-dimensional space, where d > 1 is low, under any standard definition of embedding (see Related Work).

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Deterministic identity testing for multivariate polynomials

Deterministic identity testing for multivariate polynomials

引用

configuralble computing: technology and applications

作者： Lipton, Richard Vishnoi, Nisheeth College of Computing Georgia Institute of Technology Atlanta GA 30332 United States

In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1,...,xn) is identically zero, in time polynomial in m, n, log(d+1) and H. Here m is the number of monomials in f, d is the maximum degree of a variable in f and 2H is the least upper bound on the magnitude of the largest coefficient in f. We assume that f has integer coefficients. The main feature of our algorithm is its conceptual simplicity. The proof uses Linnik's Theorem which is a deep fact about distribution of primes in an arithmetic progression.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

A combinatorial algorithm for computing a maximum independent set in a t-perfect graph

A combinatorial algorithm for computing a maximum independen...

引用

configuralble computing: technology and applications

作者： Eisenbrand, Friedrich Funke, Stefan Garg, Naveen Könemann, Jochen Max-Planck-Inst. fur Informatik Stuhlsatzenhausweg 85 66123 Saarbrücken Germany Indian Institute of Technology New Delhi India Carnegie Mellon University GSIA 211 Posner Hall Pittsburgh PA 15213 United States

We present a combinatorial polynomial time algorithm to compute a maximum stable set of a t-perfect graph. The algorithm rests on an Ε-approximation algorithm for general set covering and packing problems and is combinatorial in the sense that it does not use an explicit linear programming algorithm of methods from linear algebra or convex geometry. Instead our algorithm is based on basic arithmetic operations and comparisons of rational numbers which are of polynomial binary encoding size in the input.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Random walks on the vertices of transportation polytopes with constant number of sources

Random walks on the vertices of transportation polytopes wit...

引用

configuralble computing: technology and applications

作者： Cryan, Mary Dyer, Martin Müller, Haiko Stougie, Leen School of Computing University of Leeds Leeds LS2 9JT United Kingdom Dept. of Mathematics and Comp. Sci. Eindhoven University of Technology Amsterdam Netherlands CWI Amsterdam Amsterdam Netherlands

We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on the edge-vertex graph of the polytope. The analysis makes use of the multi-commodity flow technique of Sinclair [20] together with ideas developed by Morris and Sinclair [15, 16] for the knapsack problem, and Cryan et al. [2] for contingency tables, to establish that the random walk approaches the uniform distribution in time nO(m2).

关键词： Combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

Chain decompositions and independent trees in 4-connected graphs

Chain decompositions and independent trees in 4-connected gr...

引用

configuralble computing: technology and applications

作者： Curran, Sean Lee, Orlando Yu, Xingxing School of Mathematics Georgia Institute of Technology Athens GA United States

This work was motivated by the study of a multitree approach to reliability in distributed networks and by the study of non-separating paths and cycles in highly connected graphs. We first give a result on "non-separating chains" in 4-connected graphs. This result is then used to obtain a "non-separating chain decomposition" of a 4-connected graph G, and an O(|V(G)|2|E(G)|) algorithm for constructing such a decomposition. As an application of this decomposition, we show how to produce four "independent spanning trees" in a 4-connected graph in O(|V(G)|3) time.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Smaller core-sets for balls

Smaller core-sets for balls

引用

configuralble computing: technology and applications

作者： BǍdoiu, Mihai Clarkson, Kenneth L. MIT Laboratory for Computer Science 545 Technology Square NE43-371 Cambridge MA 02139-3594 United States Bell Labs 600 Mountain Avenue Murray Hill NJ 07974 United States

Given a set of points P ⊂ Rd and value Ε > 0, an Ε-core-set S ⊂ P has the property that the smallest ball containing S is an Ε-approximation of the smallest ball containing P. This paper shows that any point-set has an Ε-core-set of size ⌈2/Ε⌉. We also give a fast algorithm that finds this core-set. These results imply the existence of small core-sets for solving approximate k-center clustering and related problems. The sizes of these core-sets are considerably smaller than the previously known bounds, and imply faster algorithms;one such algorithm needs O(dn/Ε+(1/Ε)5) time to compute an Ε-approximate minimum enclosing ball (1-center) of n points in d dimensions. A simple gradient-descent algorithm is also given, for computing the minimum enclosing ball in O(dn/Ε2) time. This algorithm also implies slightly faster algorithms for computing approximately the smallest radius k-flat fitting a set of points.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：