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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

705 篇 会议
31 篇 期刊文献
3 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

420 篇 工学
- 358 篇 计算机科学与技术...
- 197 篇 软件工程
- 64 篇 信息与通信工程
- 61 篇 电气工程
- 35 篇 控制科学与工程
- 15 篇 仪器科学与技术
- 11 篇 电子科学与技术（可...
- 9 篇 生物工程
- 8 篇 机械工程
- 7 篇 农业工程
- 7 篇 生物医学工程（可授...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 航空宇航科学与技...
- 4 篇 材料科学与工程（可...
124 篇 理学
- 99 篇 数学
- 17 篇 系统科学
- 15 篇 物理学
- 14 篇 统计学（可授理学、...
- 11 篇 生物学
- 6 篇 化学
60 篇 管理学
- 33 篇 图书情报与档案管...
- 29 篇 管理科学与工程(可...
- 7 篇 工商管理
12 篇 医学
- 10 篇 临床医学
8 篇 农学
- 8 篇 作物学
6 篇 法学
- 3 篇 法学
- 3 篇 社会学
4 篇 文学
3 篇 经济学
- 3 篇 应用经济学
3 篇 教育学
- 3 篇 教育学

主题

254 篇 data structures
75 篇 data mining
75 篇 algorithm design...
56 篇 clustering algor...
42 篇 computer science
37 篇 tree data struct...
34 篇 partitioning alg...
32 篇 heuristic algori...
26 篇 boolean function...
24 篇 computational mo...
24 篇 costs
22 篇 data models
21 篇 indexes
21 篇 monitoring
21 篇 space technology
21 篇 databases
20 篇 big data
20 篇 algorithms
20 篇 itemsets
19 篇 approximation al...

机构

8 篇 rutgers universi...
4 篇 university of pe...
3 篇 at and t researc...
3 篇 department of co...
3 篇 yahoo research s...
3 篇 anhui university...
3 篇 mit csail cambri...
3 篇 bell laboratorie...
3 篇 carnegie mellon ...
3 篇 tech univ munich...
3 篇 departamento de ...
3 篇 univ penn philad...
3 篇 univ calif irvin...
3 篇 university of ma...
3 篇 univ calif berke...
2 篇 university of sc...
2 篇 swinburne univ t...
2 篇 nehanet corp san...
2 篇 at and t labs-re...
2 篇 max planck insti...

作者

11 篇 cormode graham
6 篇 guha sudipto
6 篇 muthukrishnan s.
5 篇 mcgregor andrew
4 篇 wirth anthony
4 篇 reyes nora
4 篇 s. muthukrishnan
4 篇 suh-yin lee
4 篇 hua-fu li
4 篇 korn flip
4 篇 srivastava dives...
3 篇 agrawal divyakan...
3 篇 liu yang
3 篇 marin mauricio
3 篇 cui bin
3 篇 li chen
3 篇 ferragina paolo
3 篇 leung carson k.
3 篇 tirthapura srika...
3 篇 gil-costa veroni...

语言

725 篇 英文
12 篇 其他
4 篇 中文

检索条件"任意字段=Conference on Space-Efficient Data Structures, Streams, and Algorithms"

共 740 条记录，以下是731-740 订阅

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

详细简洁

排序：

6th Distributed Memory Computing conference, DMCC 1991 - Proceedings

6th Distributed Memory Computing Conference, DMCC 1991 - Pro...

引用

6th Distributed Memory Computing conference, DMCC 1991

ISBN: (纸本)0818622903

The proceedings contain 115 papers. The topics discussed include: mapping precedence-constrained simulation tasks;a multicomputer simulation of the Galileo spacecraft command and data subsystem;resource management in a large reconfigurable transputer-based system;fault tolerance of the cyclic buddy subcube location scheme in hypercubes;automatic data partitioning on distributed memory multiprocessors;automatic support for data distribution;efficient algorithms for scheduling tasks on hypercubes;architectural support for dynamic data distribution and dynamic scheduling;communication abstraction and process refinement;scatter scheduling for problems with unpredictable structures;and probabilistic analysis of the optimal efficiency of the multi-level dynamic load balancing scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

9th conference on Foundations of software Technology and Theoretical Computer Science, FST and TCS 1989

9th Conference on Foundations of software Technology and The...

引用

9th conference on Foundations of software Technology and Theoretical Computer Science, FST and TCS 1989

ISBN: (纸本)9783540520481

The proceedings contain 27 papers. The special focus in this conference is on Foundations of software Technology and Theoretical Computer Science. The topics include: A linear-time recognition algorithm for P -reducible graphs;impossibility results in the presence of multiple faulty processes;an adaptive regulator approach for the design of load sharing algorithms;an algebraic compositional semantics of an object oriented notation with concurrency;an axiomatization of event structures;deducing causal relationships in CCS;annotated program transformations;algebraic software development concepts for module and configuration families;on the limitations of locally robust positive reductions;query evaluation with null values: How complex is completeness?;average case complexity analysis of RETE pattern-match algorithm and average size of join in databases;fast parallel approximations of the maximum weighted cut problem through derandomization;the frobenius problem;an efficient implicit data structure for path testing and searching in rooted trees and forests;robust decompositions of polyhedra;gate matrix layout revisited: Algorithmic performance and probabilistic analysis;parallel parsing on a one-way linear array of finite-state machines;energy-time trade-offs in VLSI computations;time and real-time in programs;a proof system for communicating processes with value-passing (extended abstract);a new class of separators and planarity of chordal graphs;optimal parallel algorithms on circular-arc graphs;algebraic properties of the space of multivalued and paraconsistent logic programs;an autoepistemic logical view of knowledge base;a natural semantics for logic programs with negation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An O(n log m) Algorithm for VLSI Design Rule Checking

An O(n log m) Algorithm for VLSI Design Rule Checking

引用

Design Automation conference

作者： C.R. Bonapace Chi-Yuan Lo AT and T Bell Laboratories Murray Hill NJ USA

This paper describes a new variant of the segment tree approach for VLSI design rule checking. The best known algorithms to date for flat VLSI design rule checking require O(n log n) expected time and PI expected space, where n is the total number of edges on a mask layer of the chip. We present a new algorithm that can run in O(n log m) expected time, where m is the maximum feature size on a particular mask layer. Since the maximum feature size must be bounded by the height of a chip, i.e. m ≤ O(√n), the new algorithm is adaptively more efficient than O(n log n). For layers such as diffusion or contact windows where the maximum feature size is independent of chip size, i.e. m = O(1), the new algorithm runs in O(n) expected time, a definite improvement. The improved time efficiency is achieved without sacrificing (√n) expected space complexity.

关键词： Very large scale integration Algorithm design and analysis Permission Tree data structures Fabrication Distributed computing Machinery Process design

来源：评论

学校读者我要写书评

暂无评论

Circuit compilers don't have to be slow

Circuit compilers don't have to be slow

引用

Design Automation conference

作者： W.C. Diss Mentor Graphics Corporation USA

A method for efficient complication of circuits which is used in a commercially available fault grader is described. data structures and algorithms are presented which can be used in processing circuits in a textural or schematic format. Performance is documented by showing the results for various circuits. It is shown that on the average, the compiler can process 2000 lines of CDL text per minute, and the loader and flattener process 10300 flattened nets per minute. These times show that incremental circuit changes can be performed in analysis tools without using a separate complication procedure. This efficiency is possible by creating data structures which require minimal manipulation and by the organization of data in the circuit library. Memory utilization is kept to a minimum by optimizing the location of circuit information on the data structures.< >

关键词： Circuit faults data structures Graphics Art Libraries space technology Statistics Circuit simulation Circuit analysis Information analysis

来源：评论

学校读者我要写书评

暂无评论

efficient algorithms for domination and Hamilton circuit problems on permutation graphs 7th

引用

7th conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1987

作者： Sastry, P. Shanthi Jayakumar, N. Veni Madhavan, C.E. Dept. of Computer Science and Automation Indian Institute of Science Bangalore560 012 India

ISBN: (纸本)9783540186250

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research. The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues. A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class. We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem. © 1987, Springer-Verlag.

关键词： Operations research

来源：评论

学校读者我要写书评

暂无评论

space efficient algorithms for VLSI Artwork Analysis 83

Space Efficient Algorithms for VLSI Artwork Analysis

引用

Design Automation conference

作者： T.G. Szymanski C.J. Van Wyk Bell Laboratories Inc. Murray Hill NJ USA

ISBN: (纸本)9780818600265

We present algorithms for performing connectivity analysis, transistor identification, and boolean geometric operations with region numbering. Previous methods all require O(n) space where n is the number of edges in the circuit artwork; our method takes only O(√n) space and can therefore handle circuits of any foreseeable size. Our algorithms are based on traditional scanline techniques in such a way that any implementation of our method will be at least as fast, as well as more compact. Statistics on one such implementation are presented.

关键词： Very large scale integration Algorithm design and analysis Performance analysis Circuits Statistics Geometry Proposals Hardware Costs data structures

来源：评论

学校读者我要写书评

暂无评论

A 3-dimensional representation for fast rendering of complex scenes 80

A 3-dimensional representation for fast rendering of complex...

引用

7th Annual conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980

作者： Rubin, Steven M. Whitted, Turner Bell Laboratories HolmdelNJ07733 United States

ISBN: (纸本)0897910214

Hierarchical representations of 3-dimensional objects are both time and space efficient. They typically consist of trees whose branches represent bounding volumes and whose terminal nodes represent primitive object elements (usually polygons). This paper describes a method whereby the object space is represented entirely by a hierarchical data structure consisting of bounding volumes, with no other form of representation. This homogeneity allows the visible surface rendering to be performed simply and efficiently. The bounding volumes selected for this algorithm are parallelepipeds oriented to minimize their size. With this representation, any surface can be rendered since in the limit the bounding volumes make up a point representation of the object. The advantage is that the visibility calculations consist only of a search through the data structure to determine the correspondence between terminal level bounding volumes and the current pixel. For ray tracing algorithms, this means that a simplified operation will produce the point of intersection of each ray with the bounding volumes. Memory requirements are minimized by expanding or fetching the lower levels of the hierarchy only when required. Because the viewing process has a single operation and primitive type, the software or hardware chosen to implement the search can be highly optimized for very fast execution. � ACM. All rights reserved.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Time/space efficiency of program structures for automatically generated digital signal processing software

Time/Space efficiency of program structures for automaticall...

引用

International conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： L. Morris Department of Systems Engineering and Computing Science Carleton University Ottawa Canada Resarch and Development Group Digital Equipment Corporation Maynard MA USA

It has previously been shown that automatically generated digital signal processings software can incorporate precomputed, data independent, program control and data access parameters. Such software is "time-efficient"; that is, at run time, only data dependent computation occurs. In this paper, alternative program structures, all of which accommondate the autogen feature, are examined for time/ space (memory) efficiency considerations on both conventional machines and those having cache memories. A novel structure derived from threaded code -- knotted code -- is proposed and shown to incorporate an excellent time/space tradeoff.

关键词： Signal generators Digital signal processing Signal processing algorithms Assembly Kernel Autocorrelation data engineering Systems engineering and theory Signal processing Automatic generation control

来源：评论

学校读者我要写书评

暂无评论

A language design for vector machines

A language design for vector machines

引用

1997 conference on Programming Languages and Compilers for Parallel and Vector Machines

作者： Basili, V.R. Knight, J.C. Dept. of Computer Science University of Maryland College ParkMD20742 United States ICASE M/S 132C NASA Langley Research Center HamptonVA23665 United States

This paper deals with a programming language under development at NASA's Langley Research Center for theCDC STAR-100. The design goals for the language are that it be basic in design and able to be extended as deemed necessary to serve the user community, capable of the expression of efficient algorithms by forcing the user to make the maximum use of the specialized hardware design, and easy to implement so that the language and compiler could be developed with a minimum of effort. The key to the language was in choosing the basic data types and data structures. Scalars, vectors, and strings are available data types in the language. Each basic data type has an associated set of operators which consist primarily of the operations provided by the hardware. The only data structure in the language is a restricted form of the array. Only vector and string data types may be stored in arrays, forcing the user to vectorize scalar data when it is necessary to structure it. This permits the most effective use of the machine for entities such as real arrays since the high level vector machine instructions may be used to deal with them directly. © 1975 ACM. All rights reserved.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

space-efficient data structures, streams, and algorithms 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Andrej Brodnik Alejandro López-Ortiz Venkatesh Raman Alfredo Viola

ISBN: (数字)9783642402739

ISBN: (纸本)9783642402722

This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "conference on space efficient data structures, streams and algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.

关键词： Algorithm Analysis and Problem Complexity data structures Discrete Mathematics in Computer Science Computer Graphics Numeric Computing Computer Communication Networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共74页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：