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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

4th International conference on Extending database Technology, EDBT 1994

引用

4th International conference on Extending database Technology, EDBT 1994

ISBN: (纸本)9783540578185

The proceedings contain 33 papers. The special focus in this conference is on Extending database Technology. The topics include: The object management group standardization of object technology;type derivation using the projection operation;subsumption between queries to object-oriented databases;matrix relation for statistical database management;deductive database support for data visualization;subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures;virtual schemas and bases;role-based query processing in multidatabase systems;content routing for distributed information servers;a unified approach to concurrency control and transaction recovery;algorithms for flexible space management in transaction systems supporting fine-granularity locking;indexing alternatives for multiversion locking;a rule-based approach for the design and implementation of information systems;on behavioral schema evolution in object-oriented databases;representing and using performance requirements during the development of information systems;a model-theoretic semantics of the multilevel relational model;correctness of ISA hierarchies in object-oriented database schemas;power efficient filtering of data on air;video information contents and architecture;optimizing storage of objects on mass storage systems with robotic devices;on the estimation of join result sizes;DBJ - a dynamic balancing hash join algorithm in multiprocessor database systems;tabu search optimization of large join queries;the implementation and performance evaluation of the ADMS query optimizer;optimization of nested queries in a complex object model;a multi-threaded architecture for prefetching in object bases and supporting full-text information retrieval with a persistent object store.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The performance of a highly unstructured parallel algorithm on the KSR1

The performance of a highly unstructured parallel algorithm ...

引用

Scalable High Performance Computing conference

作者： T. Nurkkala V. Kumar Department of Computer Science University of Minnesota Minneapolis MN USA

This paper examines the performance on the Kendall Square Research KSR1 multicomputer of a highly unstructured algorithm for natural language parsing. It describes a Tree Adjoining Grammar parsing algorithm that exhibits near linear speedup and very high efficiency for grammars of even moderate size. The work reported demonstrates the utility of shared-address-space parallel architectures for algorithms that require shared data structures. Finally, the paper presents practical guidelines for the efficient use of the KSR1.< >

关键词： Parallel algorithms Technical Activities Guide -TAG Natural languages Delay Natural language processing Computational complexity Computer science data structures Guidelines Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

efficient verification of symmetric concurrent systems

Efficient verification of symmetric concurrent systems

引用

IEEE International conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： C.N. Ip D.L. Dill Department of Computer Science University of Stanford Stanford CA USA

Previously (Proc. 11th Symp. on Computer Hardware Description Languages and their Application, April 1993), we proposed a reduction technique based on symmetries to alleviate the state explosion problem in automatic verification of concurrent systems. This paper describes the results of testing the technique on a wide range of algorithms and protocols, including realistic multiprocessor synchronization algorithms and cache coherence protocols. Memory requirements were reduced by amounts ranging from 83% to over 99%, and time requirements were often reduced as well. We also consider the effectiveness of the technique on different types of symmetries, such as symmetries in identical system components and symmetries in data values.< >

关键词： Protocols State-space methods data structures Boolean functions Testing Computer science Binary decision diagrams Sun

来源：评论

学校读者我要写书评

暂无评论

Exploiting cofactoring for efficient FSM symbolic traversal based on the transition relation

Exploiting cofactoring for efficient FSM symbolic traversal ...

引用

IEEE International conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： G. Cabodi P. Camurati Dipartimento di Automatica e Informatica Politecnico di Torino Turin Italy

Symbolic state space traversal techniques are one of the most notable achievements in the fields of formal verification and of automated synthesis. Transition functions and transition relations are two alternative approaches. In terms of efficiency, transition functions have proven to be superior, although the transition relation is much more expressive. The paper brings the transition relation back to a new life, profiting from recent advancements in the fields of Boolean function representation, simplification, and image computation represented by BDDs and by the generalized cofactor operator. A theoretical result allows us to considerably simplify both the process of building the transition relation and of traversing the state space. Experimental results show that performances similar to those of the transition function are obtained.< >

关键词： Boolean functions data structures State-space methods space exploration Reachability analysis Automata Formal verification Testing Partitioning algorithms Manuals

来源：评论

学校读者我要写书评

暂无评论

An efficient database storage structure for large dynamic objects

An efficient database storage structure for large dynamic ob...

引用

8th International conference on data Engineering

作者： Biliris, Alexandros Comput Sci Dept Boston Univ MA USA

ISBN: (纸本)0818625457

The author presents storage structures and algorithms for the efficient manipulation of general-purpose large unstructured objects in a database system. The large object is stored in a sequence of variable-size segments, each of which consists of a large number of physically contiguous disk blocks. A tree structure indexes byte positions within the object. Disk space management is based on the binary buddy system. The scheme supports operations that replace, insert, delete bytes at arbitrary positions within the object, and append bytes at the end of the object.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

space-efficient extraction algorithms

Space-efficient extraction algorithms

引用

European conference on Design Automation

作者： N.P. van der Meijs A.J. van Genderen Department of Electrical Engineering Delft University of Technnology Delft Netherlands

A description is given of how the authors limited the space complexity of a layout to circuit extractor by: a combination of the scanline technique with the corner stitching technique; a region-based extraction algorithm; a judicious choice of netlist format; and a union-find data structure also supporting deletions of elements. The efficiency of the new algorithms and the resulting extractor is confirmed by experimental data. These results are important, since in practice the size of the largest design that can be handled is often hard-limited by available memory.< >

关键词： Tiles Circuits data mining space technology data structures Algorithm design and analysis Very large scale integration Workstations Degradation Environmental economics

来源：评论

学校读者我要写书评

暂无评论

space efficient parallel buddy memory management

Space efficient parallel buddy memory management

引用

International conference on Computing and Information (ICCI)

作者： T. Johnson T. Davis Department of Computer and Information Science University of Florida USA

Shared memory multiprocessor systems need efficient dynamic storage allocators, both for system purposes and to support parallel programs. Memory managers are often based on the buddy system, which provides fast allocation and release. Previous parallel buddy memory managers made no attempt to coordinate the allocation, splitting and release of blocks, and as a result needlessly fragment memory. The authors present fast, and simple parallel buddy memory manager that is also as space efficient as a serial buddy memory manager. They test their algorithms using memory allocation/deallocation traces their collected from a parallel sparse matrix algorithm.< >

关键词： Memory management Clustering algorithms Sparse matrices Concurrent computing Information science Multiprocessing systems Testing Application software Message passing Tree data structures

来源：评论

学校读者我要写书评

暂无评论

An efficient database storage structure for large dynamic objects

An efficient database storage structure for large dynamic ob...

引用

International conference on data Engineering

作者： A. Biliris Computer Science Department Boston University Boston MA USA

关键词： Motion pictures Costs Application software Image storage Digital recording Relational databases Computer science database systems Image databases Image sequence analysis

来源：评论

学校读者我要写书评

暂无评论

An efficient range search algorithm for visualizing extrema of volume data 92

An efficient range search algorithm for visualizing extrema ...

引用

IEEE conference on Visualization

作者： X. Wu Y. Fang Department of Computer Science University of Western Ontario London ONT Canada Department of Electronic Engineering Tsinghua University Beijing China

ISBN: (纸本)9780818628962

A fast range search algorithm for visualizing extrema of d-dimensional volume data in real time as the user interactively moves the query range is presented. The algorithm is based on an efficient data structure, called index heap, which needs only O(N/log N) space and O(d2/sup d/N) preprocessing time to be set up, where N is the size of the d-dimensional data volume. The algorithm can answer an extremum query in O(4/sup d/) expected time, and its worst-case time complexity is O(2/sup d/ log N) per query. For dimensions two and three, the range search for extrema is effected in average O(1) time per query independently of the size of query range. Unlike previous range query algorithms in the computational geometry literature, the proposed algorithm is very simple and can be easily implemented.< >

关键词： data visualization data structures Biomedical imaging Computational geometry Statistics Medical diagnostic imaging Computer science Councils Biomedical engineering data engineering

来源：评论

学校读者我要写书评

暂无评论

A parallel scalable approach to short-range molecular dynamics on the CM-5

A parallel scalable approach to short-range molecular dynami...

引用

Scalable High Performance Computing conference

作者： R. Giles P. Tamayo Department of Electrical Computer and Systems Engineering and Center for Computational Science Boston University Boston MA USA Thinking Machines Corporation Cambridge MA USA

Presents a scalable algorithm for short-range molecular dynamics which minimizes interprocessor communications at the expense of a modest computational redundancy. The method combines Verlet neighbor lists with coarse-grained cells. Each processing node is associated with a cubic volume of space and the particles it owns are those initially contained in the volume. data structures for 'own' and 'visitor' particle coordinates are maintained in each node. Visitors are particles owned by one of the 26 neighboring cells but lying within an interaction range of a face. The Verlet neighbor list includes pointers to own-own and own-visitor interactions. To communicate, each of the 26 neighbor cells sends a corresponding block of particle coordinates using message-passing cells. The algorithms has the numerical properties of the standard serial Verlet method and is efficient for hundreds to thousands of particles per node allowing the simulation of large systems with millions of particles. Preliminary results on the new CM-5 supercomputer are described.< >

关键词： Computational modeling Concurrent computing Supercomputers Biology computing Systems engineering and theory data structures Liquids Solids Polymers Chemistry

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：