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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,470 篇 会议
1,250 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

15,723 篇 partitioning alg...
4,681 篇 clustering algor...
3,075 篇 algorithm design...
1,672 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
744 篇 hardware
735 篇 costs
734 篇 optimization
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
575 篇 approximation al...
573 篇 testing
559 篇 routing
504 篇 computer archite...
474 篇 concurrent compu...
459 篇 very large scale...
440 篇 application soft...

机构

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...
17 篇 department of co...
17 篇 school of electr...
17 篇 at and t bell la...
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,585 篇 英文
106 篇 其他
32 篇 中文

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

共 15723 条记录，以下是4711-4720 订阅

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

详细简洁

排序：

A FAST INTRA CU SIZE DECISION ALGORITHM BASED ON CANNY OPERATOR AND SVM CLASSIFIER

A FAST INTRA CU SIZE DECISION ALGORITHM BASED ON CANNY OPERA...

引用

IEEE International Conference on Image Processing

作者： Chentian Sun Xiaopeng Fan Debin Zhao Harbin Institute of Technology Harbin China

High Efficiency Video Coding (HEVC) introduces a number of new coding tools such as 35 intra prediction modes, improved coding unit structure and SAO filter and so on to improve the compression capacity of encoding. Compared with H.264/AVC, the compression performance increased by nearly 50% at the cost of the algorithm complexity increasing significantly. One of the most time-consuming part is the CU partition process which taking over 50% of the encoding time. In this paper, in order to reduce the computational pressure on the encoder side, we design an algorithm based on contour detection and SVM classifier. First, we adopt an improved Canny algorithm which is special designed for CU partition task. Then, based on SVM classifier, we introduce a new CU partition decision strategy. Experimental results show that the proposed algorithm achieves about 50% time saving on average with negligible loss of coding efficiency compared with HEVC reference software HM16.0.

关键词： partitioning algorithms Encoding Prediction algorithms Support vector machines Classification algorithms Task analysis Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Identification Information Analysis of Sample Train Set Subspace

Identification Information Analysis of Sample Train Set Subs...

引用

International Conference on Image and Graphics (ICIG)

作者： XiangFei Fu Jiliu Zhou FangNian Lang School of Computer Science(Software) Sichuan University Chengdu China School of Electric information Sichuan University Chengdu China

Principal component analysis (PCA) which is widely used in pattern recognition field aims at reducing the dimension of sample. PCA replaces variables in the original sample vectors that have redundant information with fewer integrative variables. The recognition ability used author's algorithm is tested in the paper. It is proved that zerospace do not include any identification information which would be useful for distinguishing different samples. Experiment results based of our lab's facebase and ORL face base shows the theory is right.

关键词： Information analysis Principal component analysis Face recognition Eigenvalues and eigenfunctions Testing partitioning algorithms Pattern recognition Feature extraction Image coding Frequency

来源：评论

学校读者我要写书评

暂无评论

Task assignment on uniform heterogeneous multiprocessors

Task assignment on uniform heterogeneous multiprocessors

引用

Euromicro Conference on Real-Time Systems

作者： S. Funk Sanjoy Baruah University of Georgia USA North Carolina State University USA

The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is assigned to a specific processor and all jobs generated by a task are required to execute upon the processor to which the task is assigned. A uniform heterogeneous multiprocessor is a multiprocessor in which each processor has an associated speed - a processor of speed s operating for t units of time will perform s /spl times/ t units of work. partitioning of periodic task systems requires solving the bin-packing problem, which is known to be intractable (NP-hard in the strong sense). This paper presents methods for finding an approximate utilization bound for partitioned scheduling on uniform heterogeneous multiprocessors.

关键词： Processor scheduling Scheduling algorithm partitioning algorithms Real time systems Resumes Runtime Character generation Costs Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on (ISCO) Intelligent Systems and Control

作者： Dushyant S. Potdar Tareek M. Pattewar Department of Computer Engineering R. C. Patel Institute of Technology Shirpur MS India

ISBN: (纸本)9781467378086

Data mining is nothing but the process of automatically searching large stores of data to discover patterns and trends that go beyond simple analysis. So it is observed that while doing clustering there may be a chance of occurring dissimilar data object in a cluster. This paper introduces such technology that makes the patterns more accurate, and it helps to search more accurate analysis of data. This System greedily picks the next frequent item set in the next cluster. For this the multiple viewpoints are used to measure the similarity between two different data objects is introduced. We can define similarity between two objects explicitly or implicitly. Cosine similarity measures will resolve this problem. As multiple viewpoints will focuses on similarity measures at multiple levels. These criteria will be used to group the documents based on similarity. The similarity measured between current cluster documents and also other cluster group documents.

关键词： Data mining Clustering algorithms Data models partitioning algorithms Algorithm design and analysis Computational modeling Databases

来源：评论

学校读者我要写书评

暂无评论

Parallel Point Symmetry Based Clustering for Gene Microarray Data

Parallel Point Symmetry Based Clustering for Gene Microarray...

引用

International Conference on Advances in Pattern Recognition (ICAPR)

作者： Anasua Sarkar Ujjwal Maulik Information Technology Department Government College of Engineering and Leather Technology Kolkata India SMIEEE Department of Computer Sc. and Engineering Jadavpur University Kolkata India

Point symmetry-based clustering is an important unsupervised learning tool for recognizing symmetrical convex or non-convex shaped clusters, even in the microarray datasets. To enable fast clustering of this large data, in this article, a distributed space and time-efficient scalable parallel approach for point symmetry-based K-means algorithm has been proposed. A natural basis for analyzing gene expression data using this symmetry-based algorithm, is to group together genes with similar symmetrical patterns of expression. This new parallel implementation satisfies the quadratic reduction in timing, as well as the space and communication overhead reduction without sacrificing the quality of clustering solution. The parallel point symmetry based K-means algorithm is compared with another newly implemented parallel symmetry-based K-means and existing parallel K-means over four artificial, real-life and benchmark microarray datasets, to demonstrate its superiority,both in timing and validity.

关键词： Clustering algorithms Timing Algorithm design and analysis Gene expression Convergence Data analysis partitioning algorithms Genomics Bioinformatics Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

Analysis of some cutting plane algorithms of integer programming

Analysis of some cutting plane algorithms of integer program...

引用

Dynamics of Systems, Mechanisms and Machines (Dynamics)

作者： Alexander A. Kolokolov Lidia A. Zaozerskaya Sobolev Institute of Mathematics Siberian Branch Russian Academy of Sciences Omsk Russia

ISBN: (纸本)9781509040513

Discrete optimization models and methods, in particular, the apparatus of integer programming, are often used for solving and analysis of many decision-making problems in computers design, productions planning and management, information technologies, engineering. In this paper we investigate some cutting plane algorithms for solving the set packing problem, which has a lot of applications in the mentioned above areas. We give previously obtained estimates on the number of iterations (cutting planes) of these algorithms. We study one class of the problems with random input data. This paper presents an original method for construction of families of set packing problems, which are polynomially solvable on average. Upper bounds on the average iterations number for the problems of these families are built.

关键词： Algorithm design and analysis partitioning algorithms Optimization Linear programming Upper bound IP networks Mathematical model

来源：评论

学校读者我要写书评

暂无评论

An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding

An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline...

引用

IEEE Symposium on On-Line Testing (IOLTS)

作者： Osama Al-Khaleel Chris Papachristou Francis Wolff Kiamal Pekmestzi Case Western Reserve University Cleveland OH USA National and Technical University of Athens Athens Greece

In this paper we present an efficient design technique for implementing the elliptic curve cryptographic (ECC) scheme in FPGAs. Our technique is based on a novel and efficient implementation of modular multiplication which is the core operation of ECC. To implement large bit-length multiplications we used a novel partitioning and pipeline folding scheme to fit at least 256-bit modular multiplications on a single Virtex-4 FPGA. Comparisons to several other schemes are presented.

关键词： Elliptic curve cryptography Field programmable gate arrays Pipelines Galois fields Elliptic curves Communication system security partitioning algorithms Data security Bandwidth Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Efficient and Robust Computation of Resource Clusters in the Internet

Efficient and Robust Computation of Resource Clusters in the...

引用

IEEE International Conference on Cluster Computing

作者： Chuang Liu Ian Foster University of Chicago USA Mathematics and Computer Science Division Argonne National Laboratory USA

Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to get good performance. We present an efficient heuristic algorithm to find a set of resources with the property that the network latency between any pair of those resources is less (or more) than a given value in the Internet. Our algorithm proceeds in two phases: (1) we use a network flow technique to partition resources into clusters based on end-to-end network latency such that resources in a cluster have much smaller latency with each other than with other resource; then (2) we search for required resources in these clusters. We evaluate this method in a large distributed Internet environment, PlanetLab, and show that our method can improve the performance of current search algorithms remarkably. We also show that our method is robust despite incomplete and noisy latency measurement data

关键词： Robustness Internet Delay Clustering algorithms partitioning algorithms Parallel processing Heuristic algorithms IP networks Working environment noise Extraterrestrial measurements

来源：评论

学校读者我要写书评

暂无评论

A fuzzy C-means clustering placement algorithm

A fuzzy C-means clustering placement algorithm

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： M. Razaz School of Information Systems University of East Anglia Norwich UK

A placement algorithm based on fuzzy c-means clustering techniques is presented. The first stage of the algorithm is to construct the max-product transitive closure of the connection matrix, which is then used as a fuzzy similarity relation in a clustering process. This stage is then followed by a combination of fuzzy c-means clustering and linear ordering process to partition modules and construct the final placement configuration. Details of various building blocks of the algorithm and its complexity of computation are described. Experimental results using the algorithm are presented and discussed.< >

关键词： Clustering algorithms partitioning algorithms Fuzzy sets Information systems Application specific integrated circuits Computational complexity

来源：评论

学校读者我要写书评

暂无评论

C/sup 3/: an architecture-independent model for coarse-grained parallel machines

C/sup 3/: an architecture-independent model for coarse-grain...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： S.E. Hambrusch A.A. Khokhar Department of CS Purdue University West Lafayette IN USA School of EE and Department of CS Purdue University West Lafayette IN USA

We propose an architecture-independent parallel model, the C/sup 3/-model. The C/sup 3/-model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication, and the potential congestion arising in communication operations. A metric for estimating the effect of link and processor congestion on the performance of an arbitrary communication operation as developed. We describe how the C/sup 3/-model can serve as a platform for the development of coarse-grained algorithms sensitive to the parameters of a parallel machine. The initial validation of the C/sup 3/-model is discussed through different implementations of communication operations on the Intel Touchstone Delta.< >

关键词： Parallel machines Concurrent computing Predictive models partitioning algorithms Parallel algorithms Computer architecture Bridges Hardware Computational modeling Programming profession

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 468 469 470 471 472 473 474 475 476 477 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：