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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Learning Bayesian networks structures from incomplete data: An efficient approach based on extended evolutionary programming

引用

9th Pacific/Asia conference on Knowledge Discovery and data Mining

作者： Li, XL He, XD Yuan, SM Jilin Univ Coll Comp Sci & Technol Changchun 130012 Peoples R China Vanda Grp VAS China Operat Seoul 130012 South Korea

ISBN: (纸本)3540260765

This paper describes a new data mining algorithm to learn Bayesian networks structures from incomplete data based on extended Evolutionary programming (EP) method and the Minimum Description Length (MDL) metric. This problem is characterized by a huge solution space with a highly multimodal landscape. The algorithm presents fitness function based on expectation, which converts incomplete data to complete data utilizing current best structure of evolutionary process. Aiming at preventing and overcoming premature convergence, the algorithm combines the restart strategy into EP. The experimental results illustrate that our algorithm can learn a good structure from incomplete data.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

space-efficient bounded model checking 05

Space-efficient bounded model checking

引用

Design, Automation and Test in Europe conference and Exhibition (DATE 05)

作者： Katz, J Hanna, Z Dershowitz, N Intel Corp Haifa Israel

ISBN: (纸本)0769522882

Current algorithms for bounded model checking use SAT methods for checking satisfiability of Boolean formulae. These methods suffer from the potential memory explosion problem. Methods based on the validity of Quantified Boolean Formulae (QBF) allow an exponentially more succinct representation of formulae to be checked, because no "unrolling" of the transition relation is required. These methods have not been widely efficient decision procedure used, because of the lack of an efficient for QBF We evaluate the usage of QBF in bounded model checking (BMC), using general-purpose SAT and QBF solvers. We develop a special-purpose decision procedure for QBF used in BMC, and compare out- technique with the methods using general-puipose SAT and QBF solvers on real-life industrial benchmarks.

关键词： Explosions Jacobian matrices Computer science data structures Boolean functions Reachability analysis Testing Interpolation Performance evaluation Design automation

来源：评论

学校读者我要写书评

暂无评论

Offline and data stream algorithms for efficient computation of synopsis structures

Offline and data stream algorithms for efficient computation...

引用

VLDB 2005 - 31st International conference on Very Large data Bases

作者： Guha, Sudipto Shim, Kyuseok Computer and Information Sciences University of Pennsylvania Electrical Engineering and Computer Science Seoul National University Computer Information Sciences Department University of Pennsylvania School of Electrical Engineering and Computer Science Seoul National University Korea Republic of

ISBN: (纸本)1595931546

Synopsis and small space representations are important data analysis tools and have long been used OLAP/DSS systems, approximate query answering, query optimization and data mining. These techniques represent the input in terms broader characteristics and improve efficiency of various applications, e.g., learning, classification, event detection, among many others. In a recent past, the synopsis techniques have gained more currency due to the emerging areas like data stream management. In this tutorial, we propose to revisit algorithms for Wavelet and Histogram synopsis construction. In the recent years, a significant number of papers have appeared which has advanced the state-of-the-art in synopsis construction considerably. In particular, we have seen the development of a large number of efficient algorithms which are also guaranteed to be near optimal. Furthermore, these synopsis construction problems have found deep roots in theory and database systems, and have influenced a wide range of problems. In a different level, a large number of the synopsis construction algorithms use a similar set of techniques. It is extremely valuable to discuss and analyze these techniques, and we expect broader pictures and paradigms to emerge. This would allow us to develop algorithms for newer problems with greater ease. Understanding these recurrent themes and intuition behind the development of these algorithms is one of the main thrusts of the tutorial. Our goal will be to cover a wide spectrum of these topics and make the researchers in VLDB community aware of the new algorithms, optimum or approximate, offline or streaming. The tutorial will be self contained and develop most of the mathematical and database backgrounds needed.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Shape shifting tries for faster IP route lookup

Shape shifting tries for faster IP route lookup

引用

13TH IEEE International conference on Network Protocols, ICNP 2005

作者： Song, Haoyu Turner, Jonathan Lockwood, John Applied Research Laboratory Washington University St. Louis

ISBN: (纸本)0769524370

Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2], Unfortunately, the time required by these algorithms grows in proportion to the address length, making them less attractive for IPv6. This paper describes and evaluates a new data structure called a shape-shifting trie, in which the data structure nodes correspond to arbitrarily shaped subtrees of the underlying binary trie for a given set of address prefixes. The ability to adapt the node shape to the trie reduces the number of nodes that must be accessed to perform a lookup, especially for tries with large sparse regions. We give a fast algorithm for optimally dividing a trie into nodes so as to minimize the maximum lookup depth. We show that seven data structure accesses are sufficient for route tables with more than 150,000 IPv6 prefixes. This makes it possible to achieve wire-speed processing for OC192 link using a single QDRII SRAM chip. © 2005 IEEE.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for finding double-vertex dominators in circuit graphs 05

An efficient algorithm for finding double-vertex dominators ...

引用

Design, Automation and Test in Europe conference and Exhibition (DATE 05)

作者： Teslenko, M Dubrova, E KTH IMIT Royal Inst Technol S-16446 Kista Sweden

ISBN: (纸本)0769522882

Graph dominators provide a general mechanism for identifying re-converging paths in circuits. This is useful in a number of CAD applications including computation of signal probabilities for test generation, switching activities for power and noise analysis, statistical timing analysis, cut point selection in equivalence checking, etc. Single-vertex dominators are too rare in circuit graphs to handle re-converging paths in a practical way. This paper addresses the problem of finding double-vertex dominators, which occur more frequently. First, we introduce a data structure, called dominator chain, which allows representing all possible O(n(2)) double-vertex dominators of a given vertex in O(n) space, where n is the number of vertices of the circuit graph. Dominator chains can be efficiently manipulated, e.g. it takes constant time to look-up whether a given pair of vertices is a double-vertex dominator. Second, we present an efficient algorithm for finding double-vertex dominators. The experimental results show that the presented algorithm is an order of magnitude faster than existing algorithms for finding double-vertex dominators. Thus, it is suitable for running in an incremental manner during logic synthesis.

关键词： Signal analysis Computer applications Probability Circuit testing Power generation Signal generators Circuit noise Noise generators Timing data structures

来源：评论

学校读者我要写书评

暂无评论

An automated approach to design shape morphing strategies for reconfigurable surfaces

An automated approach to design shape morphing strategies fo...

引用

Smart structures and Materials 2005 conference

作者： Srinivasa, N HRL Labs LLC Malibu CA 90265 USA

ISBN: (纸本)0819457388

Reconfigurable and morphing structures have attracted attention for potentially providing a range of new functionalities including system optimization over broad operational conditions and multi-mission capability. One promising approach for creating large deformation morphing structures uses variable stiffness components to provide large deformation without large energy input to the system. In this paper, we present an automated approach to design shape morphing strategies for reconfigurable surfaces composed of variable stiffness components. Variable stiffness components create an ill-posed control problem and generally have multiple solutions for any given morphing task. We formulate this problem as an optimization search using genetic algorithms (GA) to efficiently search the design space and rapidly arrive at a family of plausible solutions. Our novel approach can simultaneously satisfy a broad range of design constraints including structural properties, mechanical loading, boundary conditions and shape. Critical to GA searching is an accurate and computationally efficient variable stiffness surface model. Computer simulation of the reconfigurable surface was performed using a physics based model of the variable stiffness surface. The surface is modeled as a thin elastic plate in which the stretching and bending elastic moduli are treated separately and as arbitrary functions defined over the surface. This allows for large deformations including complete foldings. The resulting nonlinear difference equations are solved using various preconditioned global search based relaxation algorithms. The results of our simulations show that our approach not only allows us to verify the feasibility of morphing tasks of variable stiffness surfaces, but also enables us to efficiently explore much larger design spaces resulting in unique and non-obvious morphing strategies.

关键词： Genetic algorithms Actuators Optimization (mathematics) Chemical elements Computer simulations Binary data Physics Structural design Beam shaping Genetics

来源：评论

学校读者我要写书评

暂无评论

Improved sequential pattern mining using an extended bitmap representation

引用

16th International conference on database and Expert Systems Applications, DExa 2005

作者： Wu, Chien-Liang Koh, Jia-Ling An, Pao-Ying Department of Information and Computer Education National Taiwan Normal University Taipei 106 Taiwan

ISBN: (纸本)9783540285663

The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm was proposed in SIGKDD'2002, which utilized a depth-first traversal on the search space combined with a vertical bitmap representation to provide efficient support counting. According to its experimental results, SPAM outperformed the previous works SPADE and PrefixSpan algorithms on large datasets. However, the SPAM algorithm is efficient under the assumption that a huge amount of main memory is available such that its practicability is in question. In this paper, an Improved-version of SPAM algorithm, called I-SPAM, is proposed. By extending the structures of data representation, several heuristic mechanisms are proposed to speed up the efficiency of support counting further. Moreover, the required memory size for storing temporal data during mining process of our method is less than the one needed by SPAM. The experimental results show that I-SPAM can achieve the same magnitude efficiency and even better than SPAM on execution time under about half the maximum memory requirement of SPAM. © Springer-Verlag Berlin Heidelberg 2005.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Effective computation of biased quantiles over data streams

Effective computation of biased quantiles over data streams

引用

International conference on data Engineering

作者： G. Cormode F. Korn S. Muthukrishnan D. Srivastava Bell Laboratories Lucent Technologies Inc. USA AT and T Research Laboratories USA Rutgers University USA

Skew is prevalent in many data sources such as IP traffic streams. To continually summarize the distribution of such data, a high-biased set of quantiles (e.g., 50th, 90th and 99th percentiles) with finer error guarantees at higher ranks (e.g., errors of 5, 1 and 0.1 percent, respectively) is more useful than uniformly distributed quantiles (e.g., 25th, 50th and 75th percentiles) with uniform error guarantees. In this paper, we address the following two problems. First, can we compute quantiles with finer error guarantees for the higher ranks of the data distribution effectively using less space and computation time than computing all quantiles uniformly at the finest error? Second, if specific quantiles and their error bounds are requested a priori, can the necessary space usage and computation time be reduced? We answer both questions in the affirmative by formalizing them as the "high-biased" and the "targeted" quantiles problems, respectively, and presenting algorithms with provable guarantees, that perform significantly better than previously known solutions for these problems. We implemented our algorithms in the Gigascope data stream management system, and evaluated alternate approaches for maintaining the relevant summary structures. Our experimental results on real and synthetic IP data streams complement our theoretical analyses, and highlight the importance of lightweight, non-blocking implementations when maintaining summary structures over highspeed data streams.

关键词： Distributed computing Probability distribution Telecommunication traffic Fluid flow measurement Time measurement Displays TCPIP Statistics

来源：评论

学校读者我要写书评

暂无评论

efficient algorithms for pattern matching on directed acyclic graphs

Efficient algorithms for pattern matching on directed acycli...

引用

International conference on data Engineering

作者： Li Chen A. Gupta M.E. Kurul San Diego Supercomputer Center La Jolla CA USA

ISBN: (纸本)0769522858

Recently graph data models have become increasingly popular in many scientific fields. efficient query processing over such data is critical. Existing works often rely on index structures that store pre-computed transitive relations to achieve efficient graph matching. In this paper, we present a family of stack-based algorithms to handle path and twig pattern queries for directed acyclic graphs (DAGs) in particular. With the worst-case space cost linearly bounded by the number of edges in the graph, our algorithms achieve a quadratic runtime complexity in the average size of the query variable bindings. This is optimal among the navigation-based graph matching algorithms.

关键词： Pattern matching Instruction sets Encoding Neurons Tree graphs data models Ontologies Anatomy Supercomputers Query processing

来源：评论

学校读者我要写书评

暂无评论

efficient creation and incremental maintenance of the HOPI index for complex XML document collections

Efficient creation and incremental maintenance of the HOPI i...

引用

International conference on data Engineering

作者： R. Schenkel A. Theobald G. Weikum Max Planck Institut für Informatik Saarbrucken Germany

The HOPI index, a connection index for XML documents based on the concept of a 2-hop cover, provides space- and time-efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in XML search engines. This paper presents enhanced algorithms for building HOPI, shows how to augment the index with distance information, and discusses incremental index maintenance. Our experiments show substantial improvements over the existing divide-and-conquer algorithm for index creation, low space overhead for including distance information in the index, and efficient updates.

关键词： XML Search engines Tree graphs Testing Availability Portals Interference Intelligent structures Encoding data engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 56 57 58 59 60 61 62 63 64 65 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：