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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
34 篇 期刊文献
3 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

424 篇 工学
- 362 篇 计算机科学与技术...
- 197 篇 软件工程
- 64 篇 信息与通信工程
- 61 篇 电气工程
- 35 篇 控制科学与工程
- 15 篇 仪器科学与技术
- 12 篇 生物工程
- 11 篇 电子科学与技术（可...
- 8 篇 机械工程
- 7 篇 农业工程
- 7 篇 生物医学工程（可授...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 航空宇航科学与技...
- 4 篇 材料科学与工程（可...
127 篇 理学
- 99 篇 数学
- 17 篇 系统科学
- 17 篇 统计学（可授理学、...
- 15 篇 物理学
- 14 篇 生物学
- 6 篇 化学
61 篇 管理学
- 33 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 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 篇 algorithms
22 篇 data models
21 篇 indexes
21 篇 monitoring
21 篇 space technology
21 篇 databases
20 篇 big data
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...
3 篇 purdue univ dept...
2 篇 university of sc...
2 篇 swinburne univ t...
2 篇 nehanet corp san...
2 篇 at and t labs-re...

作者

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 篇 英文
15 篇 其他
4 篇 中文

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

共 743 条记录，以下是711-720 订阅

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

详细简洁

排序：

A multiresolution stochastic process for image compression

A multiresolution stochastic process for image compression

引用

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

作者： S. Moni R.L. Kashyap School of Electrical Engineering Purdue University West Lafayette IN USA

We define a data structure called a "web" together with an algorithm to choose scale-space atoms for representing an image. The corresponding wavelet coefficients (of the atoms chosen using this method) have useful properties which lead to (i) the definition of a stochastic process for representing images and (ii) an efficient image compression algorithm. The advantage of our image compression algorithm is that the computational requirement is very low. The stochastic process is useful in a theoretical sense because it gives us a framework in which to understand images and certain image compression algorithms.

关键词： Image resolution Stochastic processes Image coding Wavelet coefficients data structures Image storage HDTV Biomedical imaging Catalogs Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Binary decision diagrams on network of workstations

Binary decision diagrams on network of workstations

引用

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

作者： R.K. Ranjan J.V. Sanghavi R.K. Brayton A. Sangiovanni-Vincentelli Department of Electrical Engineering and Computer Sciences University of California Berkeley CA USA

The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW). A NOW provides a collection of main memories and disks which can be used effectively to create and manipulate very large BDDs. To make efficient use of memory resources of a Now, while completing execution in a reasonable amount of wall clock time, extension of breadth-first technique is used to manipulate BDDs. BDDs are partitioned such that nodes for a set of consecutive variables are assigned to the same workstation. We present experimental results to demonstrate the capability of such an approach and point towards the potential impact for manipulating very large BDDs.

关键词： data structures Boolean functions Workstations Binary decision diagrams Computer networks Local area networks FDDI Concurrent computing space technology Delay

来源：评论

学校读者我要写书评

暂无评论

T*-tree: a main memory database index structure for real time applications

T*-tree: a main memory database index structure for real tim...

引用

IEEE International conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Kong-Rim Choi Kyung-Chang Kim Department of Computer Science Hongik University Seoul South Korea

In this paper, we propose an indexing structure, called T*-tree, for efficient processing of real time applications under main memory database management systems (MMDBMS). T*-tree is an index structure for rapid data access and saves memory space under MMDBMS. T-tree is well known to be one of the best index structures for ordered data in MMDB. Existing T-tree is a balanced tree that evolved from AVL and B-trees, and a binary tree with many elements in a node. T-tree retains the intrinsic binary search nature, and is also good in memory use. However T-tree has major disadvantage; the tree traversal for range queries and the movement of overflow/underflow data due to data insertion/deletion on internal nodes. We propose T*-tree as a alternative structure, which is an improvement from T-tree for better use of query operations, including range queries and which contains all other good features of T-tree. We also show the pseudo-algorithms of search, update, delete, and rebalancing operations for T*-tree, with performance test results. The results indicate that T*-tree provides better performance for range queries compared to T-tree.

关键词： Indexes database systems Memory management Random access memory Transaction databases data structures Application software Computer science Indexing Real time systems

来源：评论

学校读者我要写书评

暂无评论

Multiscale detection of curvilinear structures in 2-D and 3-D image data

Multiscale detection of curvilinear structures in 2-D and 3-...

引用

Proceedings of the 5th International conference on Computer Vision

作者： Koller, Th.M. Gerig, G. Szekely, G. Dettwiler, D. ETH-Zentrum Zurich Switzerland

This paper presents a novel, parameter-free technique for the segmentation and local description of line structures on multiple scales, both in 2-D and 3-D. The algorithm is based on a nonlinear combination of linear filters and searches for elongated, symmetric line structures, while suppressing the response to edges. The filtering process creates one sharp maximum across the line-feature profile and across scale-space. The multiscale response reflects local contrast and is independent of the local width. The filter is steerable in orientation and scale domain, leading to an efficient, parameter-free implementation. A local description is obtained that describes the contrast, the position of the center-line, the width, the polarity, and the orientation of the line. Examples of images from different application domains demonstrate the generic nature of the line segmentation scheme. The 3-D filtering is applied to magnetic resonance volume data in order to segment cerebral blood vessels.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

4th International Workshop on algorithms and data structures, WADS 1995

引用

4th Workshop on algorithms and data structures, WADS 1995

ISBN: (纸本)3540602208

The proceedings contain 45 papers. The special focus in this conference is on algorithms and data structures. The topics include: The two-line center problem from a polar view;on some geometric selection and optimization problems via sorted matrices;load balancing in quorum systems;balanced distributed search trees do not exist;two-floodlight illumination of convex polygons;on the complexity of approximating and illuminating three-dimensional convex polyhedra;scheduling jobs that arrive over time;dynamic algorithms for the dyck languages;arrangements in higher dimensions;computing a shortest watchman path in a simple polygon in polynomial time;going home through an unknown street;page migration with limited local memory capacity;randomized algorithms for metrical task systems;efficient geometric algorithms for workpiece orientation in 4- and 5 axis NC machining;computing common tangents without a separating line;online perfect matching and mobile computing;competitive algorithms for the on-line traveling salesman;quadrangulations of planar sets;a linear-time construction of the relative neighborhood graph within a histogram;computing proximity drawings of trees in the 3-dimemsional space;routing on trees via matchings;a ranking algorithm for hamilton paths in shuffle-exchange graphs;amortization results for chromatic search trees, with an application to priority queues;on the computation of fast data transmissions in networks with capacities and delays;routing with delays when storage is costly;a new technique for optimal I/O-algorithms and computing a dominating pair in an asteroidal triple-free graph in linear time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computing multivariable Taylor series to arbitrary order 95

Computing multivariable Taylor series to arbitrary order

引用

Proceedings of the International conference on APL

作者： Neidinger, Richard D. Department of Mathematics Davidson College P.O. Box 1719 Davidson NC

ISBN: (纸本)9780897917223

Automatic differentiation, manipulating numerical vectors of coefficients, is the efficient way to compute multivariable Taylor series. This does not require symbolic differentiation or numerical approximation but uses exact formulas applied to numerical arrays. Arrays of Taylor series coefficients of any elementary function can be built-up, as the array for each component (combination or function) is a combination of its argument arrays. The functions TIMES and EXP display the algorithmic ideas that enable all of the other standard functions. We study the interesting recursive formulas for these combinations, the resulting algorithms, and the implementation in APL. To handle all coefficients in n variables up to order m, the arrays are hyper-pyramid data structures, considered conceptually as n-dimensional but implemented as one-dimensional arrays. Unlike previous work, this implementation does not require huge arrays for binomial coefficients and indirect referencing. This APL*PLUS III implementation loops through one nested reference array and takes sub-arrays from another for a practical solution to this problem that can make tremendous demands on time and space.

关键词： nested arrays Taylor series automatic differentiation partial derivatives numerical method data structure

来源：评论

学校读者我要写书评

暂无评论

efficient Variable Ordering and Partial Representation Algorithims

Efficient Variable Ordering and Partial Representation Algor...

引用

Proceedings of the 8th International conference on VLSI Design

作者： Jain, Jawahar Moundanos, Dinos Bitner, Jim Abraham, J.A. Fussell, D.S. Ross, D.E. Fujitsu Laboratories of America 77 Rio Robles San JoseCA95134-1807 United States Computer Engineering Research Center The University of Texas at Austin AustinTX78712 United States The Department of Electrical Engineering Texas A & M University College StationTX77843 United States

In this paper we introduce some new methods for con-structing Ordered Partial Decision Diagrams (OPDDs). The algorithms are effective in capturing a significant fraction of a given function's truth table using only a very small space. Using such data structures the importance of a variable in a Boolean function can be computed. Such methods can easily be used for computing effective variable orders to construct BDDs. The measures of a variable's importance are based on information-theoretic criteria, and require computation of the entropy of a variable for a given function. We have found that entropy measures can be quite efficient in distinguishing the importance of variables, and at times provide very effective variable order. The results show an encouraging approach towards the understanding and the solution of this well known problem. © 1995 IEEE.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

CAD model acquisition using BSP trees

CAD model acquisition using BSP trees

引用

IEEE International Workshop on Intelligent Robots and Systems (IROS)

作者： M. Reed P.K. Allen S. Abrams Center for Research in Intelligent Systems Department of Computer Science Columbia University New York NY USA

This paper discusses an approach to automating CAD model acquisition by creating binary space partitioning (BSP) trees from laser range data. Distinct views of the object, each represented by a BSP tree, are then merged using set operations. BSP trees have proven their utility in 3D modeling, graphics and image processing, and their tree structure allows efficient algorithms to be developed that are compact and numerically robust. These properties are of primary importance when considering an intermediate representation between raw sensor data and existing CAD models.

关键词： Tree graphs Laser modes Graphics Image processing Tree data structures Partitioning algorithms Robustness

来源：评论

学校读者我要写书评

暂无评论

Voting model based diagnosis of bridging faults in combinational circuits

Voting model based diagnosis of bridging faults in combinati...

引用

International conference on VLSI Design

作者： Chakravarty Y. Gong Department of Computer Science State University of New York University at Buffalo Buffalo NY USA

ISBN: (纸本)0818669055

A novel algorithm for diagnosing bridging faults in combinational circuits is presented. The voting model is assumed. The diagnosis algorithm guarantees the "object bridging fault" (bridging fault in the circuit being diagnosed) to be in the final fault list. The novelties of the algorithm are: (i) unlike previous algorithms it does not use the full fault dictionary but uses portions of the stuck-at fault dictionary which is computed dynamically; (ii) it enumerates the faults implicitly using a compact data structure; and (iii) fault dropping rules, using stuck-at fault simulation only, are used. The resulting algorithm is both time and space efficient. Experimental evaluation of the algorithm is presented.

关键词： Voting Fault diagnosis Circuit faults Combinational circuits Dictionaries Logic Circuit testing data structures Computational modeling space technology

来源：评论

学校读者我要写书评

暂无评论

efficient variable ordering and partial representation algorithm

Efficient variable ordering and partial representation algor...

引用

International conference on VLSI Design

作者： J. Jain D. Moundanos J. Bitner J.A. Abraham D.S. Fussell D.E. Ross Fujitsu Laboratories of America Inc. San Jose CA USA Computer Engineering Research Center University of Texas Austin Austin TX USA The Department of Electrical Engineering Texas A and M University College Station TX USA

In this paper we introduce some new methods for constructing Ordered Partial Decision Diagrams (OPDDs), The algorithms are effective in capturing a significant fraction of a given function's truth table using only a very small space. Using such data structures the importance of a variable in a Boolean function can be computed. Such methods can easily be used for computing effective variable orders to construct BDDs. The measures of a variable's importance are based on information-theoretic criteria, and require computation of the entropy of a variable for a given function. We have found that entropy measures can be quite efficient in distinguishing the importance of variables, and at times provide very effective variable order. The results show an encouraging approach towards the understanding and the solution of this well known problem.

关键词： Entropy Boolean functions Circuit testing Laboratories data structures Protocols Circuit faults Input variables Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：