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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,455 篇 会议
1,287 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

15,745 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,673 篇 工学
- 1,946 篇 计算机科学与技术...
- 1,735 篇 电气工程
- 710 篇 信息与通信工程
- 554 篇 控制科学与工程
- 546 篇 软件工程
- 286 篇 机械工程
- 232 篇 电子科学与技术（可...
- 231 篇 仪器科学与技术
- 46 篇 测绘科学与技术
- 38 篇 交通运输工程
- 30 篇 网络空间安全
- 22 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 13 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
371 篇 管理学
- 368 篇 管理科学与工程(可...
310 篇 理学
- 131 篇 系统科学
- 73 篇 数学
- 55 篇 物理学
- 28 篇 生物学
- 25 篇 地球物理学
- 12 篇 统计学（可授理学、...
82 篇 医学
- 75 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 教育学
- 9 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,745 篇 partitioning alg...
4,684 篇 clustering algor...
3,088 篇 algorithm design...
1,673 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
749 篇 hardware
735 篇 costs
724 篇 optimization
720 篇 image segmentati...
658 篇 iterative algori...
593 篇 parallel process...
576 篇 approximation al...
576 篇 testing
561 篇 routing
505 篇 computer archite...
477 篇 concurrent compu...
461 篇 very large scale...
444 篇 shape

机构

40 篇 ibm thomas j. wa...
38 篇 department of co...
31 篇 school of comput...
25 篇 department of co...
22 篇 department of co...
20 篇 department of el...
18 篇 school of comput...
18 篇 department of co...
18 篇 department of el...
18 篇 at and t bell la...
17 篇 department of co...
17 篇 school of electr...
16 篇 school of comput...
16 篇 department of el...
16 篇 institute of com...
16 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of el...
15 篇 school of electr...

作者

25 篇 xianlong hong
19 篇 hichem frigui
15 篇 yici cai
14 篇 sanghamitra band...
13 篇 jun wang
13 篇 g. karypis
13 篇 li li
13 篇 jing wang
12 篇 sriparna saha
12 篇 tzung-pei hong
12 篇 a.k. jain
12 篇 thambipillai sri...
11 篇 suleyman s. koza...
11 篇 hau-san wong
11 篇 yu wang
11 篇 hui wang
11 篇 jian-jia chen
11 篇 p. banerjee
11 篇 sanjoy baruah
11 篇 francisco de a.t...

语言

15,591 篇 英文
122 篇 其他
32 篇 中文

检索条件"主题词=partitioning algorithms"

共 15745 条记录，以下是4961-4970 订阅

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

详细简洁

排序：

Using co-training to empower active learning

Using co-training to empower active learning

引用

IEEE Signal Processing and Communications Applications (SIU)

作者： Payam V. Azad Yusuf Yaslan Computer Engineering Departmenet Istanbul Technichal University

ISBN: (纸本)9781509064953

Active Learning and co-training are cases of semi-supervised learning both are used when labeled data is scarce. Active learning attempts to improve learning model by querying over unlabeled data and the main challenge there, is to find the optimum instance query. And co-training tries to exploit two different feature sets to enlarge number of labeled data without any need to get external information. Several researches tried to couple these two methods and get best out of them and they achieve noteworthy results. But we have witnessed that using co-training and active learning in sequence architecture outperforms when they are working in parallel. Using them in sequence means we have used co-training techniques to just find the best queries for active learning, and not in learning process itself. We will demonstrate that it has better results than plain active learning and co-training and even current parallel architectures. For this work we have used different techniques to split data into two distinct datasets; we will also discuss about it alongside our query selection method.

关键词： Training Feature extraction Analysis of variance Prediction algorithms partitioning algorithms Sonar Machine learning algorithms

来源：评论

学校读者我要写书评

暂无评论

The performance factors of clustering ensembles

The performance factors of clustering ensembles

引用

IEEE Signal Processing and Communications Applications (SIU)

作者： M. Fatih Amasyali Okan Ersoy Bilgisayar Muhendisligi Bolumu Yildiz Teknik Universitesi Turkey Elektrik ve Bilgisayar Muhendisligi Bolumu Purdue Universitesi Turkey

The accomplishments on classifier ensembles originate the studies of clustering ensembles. In this study the factors on performance of clustering ensembles (clustering algorithm, the number of features used in clustering, the size of ensemble, the decision combining algorithm) are investigated and compared on 15 benchmark datasets. The decisions of clustering algorithms based on different feature subsets are combined. On the process of decision combination, the graph partition algorithms are averaged successful while hierarchical algorithms have best individual successes. The number of features used in clustering algorithms increases the success. The size of clustering ensemble is also direct proportional with clustering performance. Kmeans and fuzzy-kmeans are best clustering algorithms over our experimented datasets.

关键词： Clustering algorithms partitioning algorithms Art Classification algorithms Medical diagnostic imaging Machine learning Organizing

来源：评论

学校读者我要写书评

暂无评论

Where should the threads go? Leveraging hierarchical data locality to solve the thread affinity dilemma

Where should the threads go? Leveraging hierarchical data lo...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ahmad Anbar Abdel-Hameed A. Badawy Olivier Serres Tarek El-Ghazawi George Washington University Law School Washington DC US Electrical & Computer Engineering Department The George Washington University Washington DC Electrical Engineering Department Arkansas Tech University Russellville AR

We are proposing a novel framework that ameliorates locality-aware parallel programming models, by defining a hierarchical data locality model extension. We also propose two hierarchical thread partitioning algorithms. These algorithms synthesize hierarchical thread placement layouts that targets minimizing the program's overall communication costs. We demonstrate the effectiveness of our approach using the NAS Parallel Benchmarks implemented in Unified Parallel C (UPC) using a modified Berkeley UPC Compiler and runtime system. We achieved performance gains of up to 88% in performance by applying the placement layouts our algorithms suggest.

关键词： Message systems Measurement Clustering algorithms partitioning algorithms Instruction sets Kernel Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

The priority queue as an example of hardware/software codesign 94

The priority queue as an example of hardware/software codesi...

引用

International Workshop on Hardware/Software Codesign (CODES)

作者： F. Hoeg N. Mellergaard J. Staunstrup Department of Computer Science Technical University of Denmark Lyngby Denmark

ISBN: (纸本)9780818663154

The paper identifies a number of issues that are believed to be important for hardware/software codesign. The issues are illustrated by a small comprehensible example: a priority queue. Based on simulations of a real application, we suggest a combined hardware/software realization of the priority queue. A priority queue is a data structure with a simple interface which in many applications is a performance bottleneck.< >

关键词： Hardware Application software Computational modeling Data structures Computer science Software performance Discrete event simulation partitioning algorithms Software algorithms Traffic control

来源：评论

学校读者我要写书评

暂无评论

Nature inspired techniques for data clustering

Nature inspired techniques for data clustering

引用

International Conference on Circuits, Systems, Communication and Information Technology Applications (CSCITA)

作者： Sandeep U. Mane Pankaj G. Gaikwad Dept. of CSE Rajarambapu Institute of Technology Rajaramnagar India

Nature is always a source of inspiration. In last few decades, the research is stimulated on new computing paradigms and result of this effort is emergence of new problem solving techniques like Nature Inspired Computing, Evolutionary Computing. Nature inspired problem solving techniques are widely used to solve complex problems. These techniques are widely used due to their decentralized and self-organized behavior. Such behavior is observed in social systems such as artificial bee colony algorithm, particle swarm optimization, ant colony optimization, bat algorithm, firefly algorithm, glowworm swarm optimization etc. In this paper we have given overview of nature inspired techniques used for data clustering, hybridization with traditional clustering techniques and their effectiveness.

关键词： Clustering algorithms Algorithm design and analysis partitioning algorithms Data mining Particle swarm optimization Problem-solving Information technology

来源：评论

学校读者我要写书评

暂无评论

On using cached results to enumerate maximal k-cliques in GeneWeaver

On using cached results to enumerate maximal k-cliques in Ge...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Qi Yang Greg Speegle Erich J. Baker Department of Computer Science and Software Engineering University of Wisconsin-Platteville Platteville Wisconsin School of Engineering and Computer Science Baylor University Waco TX

The online biological data analytics tool GeneWeaver [1] uses a fast algorithm to directly compute k-cliques between different sets of data. By caching such results, we are able to compute k-clique faster in some cases. We derived a formula to determine whether or not to cache a result. In order to know if the cached results can be used to compute a desired k-clique, we also created a new algorithm to solve the generalized set coverage problem.

关键词： partitioning algorithms Approximation algorithms Algebra Automobiles Computer science Biology Tools

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Visual Sensor Denoising Method Based on Event Density Classification

A Dynamic Visual Sensor Denoising Method Based on Event Dens...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Qiangxiao Zhou Hai Xiong Yiheng Wang Yuhao Shen Long Cheng College of Computer Science and Artificial Intelligence WenZhou University Wenzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Dynamic Visual Sensors (DVS) output pixel information asynchronously as an address event, only transmitting information for pixels where the intensity change exceeds a threshold, thereby reducing redundant data generation at the source. They possess advantages such as low-latency response and high efficiency with low power consumption. However, factors such as thermal noise and leakage current can lead to noise events even when the light intensity remains constant, which affects image quality and subsequent processing. In this paper, we propose a new method for calculating event density called Local Density Segmentation (LSD), which divides events and their surrounding neighborhoods into different regions for independent event density calculation. Based on LSD-calculated event density, we further propose a denoising method named Local Density Segmentation K-means (LSD-K), which utilizes event density as a feature to select and remove noise events. Finally, through experiments, we validate the performance of our algorithm.

关键词： Visualization Thermal factors Heuristic algorithms Noise Noise reduction Clustering algorithms Thermal noise Sensors partitioning algorithms Voltage control

来源：评论

学校读者我要写书评

暂无评论

Parallel computation of direct transitive closures

Parallel computation of direct transitive closures

引用

International Conference on Data Engineering

作者： Y.-N. Huang J.-P. Cheiney Ecole Nationale Superieure d''Arts et Metiers Paris France

To efficiently process recursive queries in a DBMS (database management system), a parallel, direct transitive closure algorithm is proposed. Efficiency is obtained by reorganizing the computation order of Warren's algorithm. The number of transfers among processors depends only on the number of processors and does not depend on the depth of the longest path. The evaluation shows an improvement due to the parallelism and the superiority of the proposed algorithm over recent propositions. The speed of the production of new tuples is very high and the volume of transfers between the sites is reduced.< >

关键词： Concurrent computing Testing partitioning algorithms Parallel algorithms Costs Parallel processing Proposals Delay Context Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Sales partition for forecasting into textile distribution network

Sales partition for forecasting into textile distribution ne...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： M. Happiette B. Rabenasolo F. Boussu ENSAIT GEMTEX Roubaix France

This paper presents a new method for the management of buffer-stocks for textile items by a sales partition approach. The proposed algorithm enables to partition the set of items into different optimal classes, so that items belonging to each class follow the same forecasting sales graph. This method uses a sequence of merging of classes. In this sequence, an internal index measuring the compactness inside each class and the separability between different classes enables to determine the best partition. Then, for each class created, the compactness is compared to the initial compactness criterion given by the industrial manager and, the class which doesn't respect the classification accuracy is rejected. A faster searching of the forecasted sales graph for an item is thus achieved by the determination of a mean graph corresponding to its family sale.

关键词： Marketing and sales partitioning algorithms Mass production Economic forecasting Tellurium Merging Product design Computer industry Textile industry Application software

来源：评论

学校读者我要写书评

暂无评论

A simultaneous placement and global routing algorithm for an FGPA with hierarchical interconnection structure

A simultaneous placement and global routing algorithm for an...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Ping-Tsung Wang Kun-Nen Chen Department of Electrical Engineering National Cheng Kung University Hospital Tainan Taiwan

An efficient layout design algorithm is presented. The algorithm simultaneously perform the placement and the global routing for the design of using FPGA with hierarchical interconnection structure (HFPGA). It is based on a k-way min-cut placement technique. The min-cut technique generates a partitioning tree which is then used to assign logic blocks to realize the function of modules in the netlist. The partitioning tree is also used to find the routing paths of interconnections between the logic blocks. Investigation is performed experimentally by implementing a set of industrial circuits using the algorithm.

关键词： Routing Field programmable gate arrays Integrated circuit interconnections partitioning algorithms Programmable logic arrays Algorithm design and analysis Clustering algorithms Costs Prototypes Electronics packaging

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：