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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Bursty and hierarchical structure in streams

Bursty and hierarchical structure in streams

引用

KDD - 2002 Proceedings of the Eight ACM SIGKDD International conference on Knowledge Discovery and data Mining

作者： Kleinberg, Jon Department of Computer Science Cornell University Ithaca NY 14853 United States

A fundamental problem in text data mining is to extract meaningful structure from document streams that arrive continuously over time. E-mail and news articles are two natural examples of such streams, each characterized by topics that appear, grow in intensity for a period of time, and then fade away. The published literature in a particular research field can be seen to exhibit similar phenomena over a much longer time scale. Underlying much of the text mining work in this area is the following intuitive premise - that the appearance of a topic in a document stream is signaled by a "burst of activity," with certain features rising sharply in frequency as the topic emerges. The goal of the present work is to develop a formal approach for modeling such "bursts," in such a way that they can be robustly and efficiently identified, and can provide an organizational framework for analyzing the underlying content. The approach is based on modeling the stream using an infinite-state automation, in which bursts appear naturally as state transitions;in some ways, it can be viewed as drawing an analogy with models from queueing theory for bursty network traffic. The resulting algorithms are highly efficient, and yield a nested representation of the set of bursts that imposes a hierarchical structure on the overall stream. Experiments with e-mail and research paper archives suggest that the resulting structures have a natural meaning in terms of the content that gave rise to them.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

AC-3d an efficient arc-consistency algorithm with a low space-complexity 8th

引用

8th International conference on Principles and Practice of Constraint Programming, CP 2002

作者： van Dongen, Marc R. C. CS Department UCC/Cork Constraint Computation Centre Western Road Cork Ireland

ISBN: (纸本)3540441204

Arc-consistency algorithms prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks to find out about the properties of CSPs. Their arc-heuristics select the constraint and their domain-heuristics select the values for the next support-check. We shall combine AC-3 and DEE and equip the resulting hybrid with a double-support domain-heuristic. The resulting hybrid AC-3d is easy to implement and requires the same data structures as AC-3 thereby improving on AC-7’s space-complexity. We shall present experimental results which indicate that AC-3 can compete with AC-7. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A practical multi-word compare-and-swap operation 1

引用

16th International conference on Distributed Computing, DISC 2002

作者： Harris, Timothy L. Fraser, Keir Pratt, Ian A. University of Cambridge Computer Laboratory Cambridge United Kingdom

ISBN: (数字)9783540361084

ISBN: (纸本)3540000739

Work on non-blocking data structures has proposed extending processor designs with a compare-and-swap primitive, CAS2, which acts on two arbitrary memory locations. Experience suggested that current operations, typically single-word compare-and-swap (CAS1), are not expressive enough to be used alone in an efficient manner. In this paper we build CAS2 from CAS1 and, in fact, build an arbitrary multi-word compare-and-swap (CASN). Our design requires only the primitives available on contemporary systems, reserves a small and constant amount of space in each word updated (either 0 or 2 bits) and permits nonoverlapping updates to occur concurrently. This provides compelling evidence that current primitives are not only universal in the theoretical sense introduced by Herlihy, but are also universal in their use as foundations for practical algorithms. This provides a straightforward mechanism for deploying many of the interesting non-blocking data structures presented in the literature that have previously required CAS2. © Springer-Verlag Berlin Heidelberg 2002.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Querying and clustering very large data sets using dynamic bucketing approach 3rd

引用

3rd International conference on Advances in Web-Age Information Management, WAIM 2002

作者： Fu, Lixin Division of Computer Science Department of Mathematical Sciences University of North Carolina Greensboro 383 Bryan Building P. O. Box 26170 GreensboroNC27402-6170 United States

ISBN: (纸本)9783540440451

In this paper we give a new efficient approach called dynamic bucketing to query and cluster very large data sets, a topic of great theoretical and practical significance. We partition data into equal-width buckets and further partition dense buckets into sub-buckets as needed by efficiently reclaiming and allocating memory space. The bucketing process dynamically adapts to the input order and distribution of input data sets. We propose a new data structure called the structure trees for storing aggregation information such as histograms of the buckets and sub-buckets. Since we only store the count values, the data structure is highly aggregated, concise, and very suitable for data sets with a large number of records. We also provide new query evaluation and data clustering algorithms based on the structure trees. Our simulation results show that our approach is superior to the current leading approaches in terms of the accuracy and performance. © Springer-Verlag Berlin Heidelberg 2002.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Suffix Vector: space- and Time-efficient Alternative To Suffix Trees 02

Suffix Vector: Space- and Time-Efficient Alternative To Suff...

引用

Australasian Computer Science conference

作者： Krisztian Monostori Arkady Zaslavsky Heinz Schmidt School of Computer Science and Software Engineering Monash University Melbourne 900 Dandenong Rd Caulfield East VIC 3145

ISBN: (纸本)0909925828

Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its space requirement. This paper describes a new structure called suffix vector, which is not only better in terms of storage space but also simpler than the most efficient suffix tree representation known to date. Alternatives of storage representations are discussed and a linear-time construction algorithm is also proposed in this paper. space requirement of the suffix vector Structure is compared to the space requirement of alternative suffix tree representations. We also make a theoretical comparison on the number of operations required to run algorithms on the suffix vector.

关键词： algorithm data structure suffix tree benzoylprop-ethyl Suffix animal space requirements data structures storage spaces algorithms

来源：评论

学校读者我要写书评

暂无评论

An adaptive network/routing algorithm for energy efficient cooperative signal processing in sensor networks

An adaptive network/routing algorithm for energy efficient c...

引用

IEEE conference on Aerospace

作者： J.L. Gao Jet Propulsion Laboratory Pasadena CA USA

In this paper, we describe an adaptive network/routing algorithm that facilitates both coherent and non-coherent event-based cooperative signal processing. The core of this algorithm is a distributed election procedure that produces one or multiple winners based on a context-dependent election metric. In scenarios where non-coherent signal processing techniques are applied, a central processing node is selected, and highly compressed sensor data is gathered for processing. Energy efficiency is improved by reducing algorithm overhead because the actual sensor traffic volume is light compared to the messaging overhead of the algorithm. For coherent processing, raw data streams must be relayed from each sensor to the central processing node, producing large data streams. A multi-winner election process is initiated first to select only a limited number of sensors that will provide the raw data; then a second election process uses an energy-based metric to find the optimal central processing node, whose location minimizes the total relaying cost. Simulation results are provided to demonstrate the inherent overhead-delay trade-off and compare the scalability of the algorithm under different scenarios.

关键词： Signal processing algorithms Adaptive systems Routing Energy efficiency Adaptive signal processing Intelligent networks Nominations and elections Sensor phenomena and characterization Relays space technology

来源：评论

学校读者我要写书评

暂无评论

Improving the orthogonal range search k-windows algorithm

Improving the orthogonal range search k-windows algorithm

引用

International conference on Tools for Artificial Intelligence (ICTAI)

作者： P. Alevizos B. Boutsinas D. Tasoulis M.N. Vrahatis Department of Mathematics University of Patras Artificial Intelligence Research Center University슠of슠Patras Patras Greece Department of Business Administration UPAIRC UOP Inc. Patras Greece Department of Mathematics UPAIRC UOP Inc. Patras Greece

Clustering, that is the partitioning of a set of patterns into disjoint and homogeneous meaningful groups (clusters), is a fundamental process in the practice of science. k-windows is an efficient clustering algorithm that reduces the number of patterns that need to be examined for similarity. using a windowing technique. It exploits well known spatial data structures, namely the range free, that allows fast range searches. From a theoretical standpoint, the k-windows algorithm is characterized by lower time complexity compared to other well-known clustering algorithms. Moreover it achieves high quality clustering results. However, it appears that it cannot be directly applicable in high-dimensional settings due to the superlinear space requirements for the range tree. In this paper an improvement of the k-windows algorithm, aiming at resolving this deficiency, is presented. The improvement is based on an alternative solution to the orthogonal range search problem.

关键词： Clustering algorithms Partitioning algorithms Iterative algorithms Machine learning algorithms Mathematics data mining Artificial intelligence Tree data structures databases Pattern analysis

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling and clustering in symbolic image computation

Dynamic scheduling and clustering in symbolic image computat...

引用

Design, Automation and Test in Europe conference and Exhibition

作者： G. Cabodi P. Camurati S. Quer Dip. di Automatica e Informatica Politecnico di Turino Turin Italy

ISBN: (纸本)0769514715

The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequential behavior of the design. Computing an image or a pre-image consists of ordering the latch transition relations, clustering them and eventually re-ordering the clusters. Existing algorithms are mainly limited by memory resources. To make them as efficient as possible, we address a set of heuristics with the main target of minimizing the memory used during image computation. They include a dynamic heuristic to order the latch relations, a dynamic framework to cluster them, and the application of conjunctive partitioning during image computation. We provide and integrate a set of algorithms and we report references and comparisons with recent work. Experimental results are given to demonstrate the efficiency and robustness of the approach.

关键词： Dynamic scheduling data structures Boolean functions Binary decision diagrams Reachability analysis Latches Clustering algorithms Electronic switching systems State-space methods space exploration

来源：评论

学校读者我要写书评

暂无评论

An efficient external-memory implementation of region query with application to area routing

An efficient external-memory implementation of region query ...

引用

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

作者： S. Liao N. Shenoy W. Nicholls Advanced Technology Group Synopsys Inc.orporated USA

We present the tile-cached kd-tree, an efficient external-memory (disk) implementation of two-dimensional region query for use in a detailed area router. Most researchers have heretofore focused on in-memory algorithms. However as the need to tackle very large problems increases, conventional in-memory algorithms suffer from unpredictable caching and paging behavior and their performance may degrade considerably. In addition, since the region-query data structure is only part of the overall system, its consumption of large memory resources affects other parts of the system as well. Our implementation takes advantage of spatial locality in the detailed-routing process. We partition the routing space into tiles, each storing the data of objects (rectangles) that lie strictly within it. Objects that cross tile boundaries are separately stored. The data within a tile are then written out to disk, and a configurable cache is used to hold in memory the most recently visited tiles. Experimental results on large real-life routing problems show that this scheme significantly reduces memory usage with tolerable performance penalty.

关键词： Routing Tiles Spatial databases data structures Application software Very large scale integration Algorithm design and analysis Degradation Computational geometry Multidimensional systems

来源：评论

学校读者我要写书评

暂无评论

Computation and approximation of piecewise affine control laws via binary search trees

Computation and approximation of piecewise affine control la...

引用

IEEE conference on Decision and Control

作者： P. Tondel T.A. Johansen A. Bemporad Department of Engineering Cybernetics Norwegian University of Science and Technology Trondheim Norway Dipartimento di Ingegneria dell'Informazione University of Siena Siena Italy

We present an algorithm for generating a binary search tree that allows efficient computation of piecewise affine (PWA) functions defined on a polyhedral partition. This is useful for PWA control approaches, such as explicit model predictive control (MPC), as it allows the controller to be implemented on-line with small computational effort. The computation time is logarithmic in the number of regions in the PWA partition. A method for generating an approximate PWA function based on a binary search tree is also presented, giving further simplification of PWA control.

关键词： Binary search trees data structures State feedback Quadratic programming Partitioning algorithms Predictive models Predictive control Sampling methods State-space methods Robustness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 62 63 64 65 66 67 68 69 70 71 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：