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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,672 篇 会议
3,455 篇 期刊文献
42 篇 学位论文
4 册 图书
1 篇 资讯

馆藏范围

9,174 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,483 篇 工学
- 4,477 篇 计算机科学与技术...
- 1,615 篇 软件工程
- 1,420 篇 电气工程
- 449 篇 信息与通信工程
- 296 篇 控制科学与工程
- 268 篇 电子科学与技术（可...
- 94 篇 仪器科学与技术
- 75 篇 机械工程
- 74 篇 力学（可授工学、理...
- 63 篇 动力工程及工程热...
- 63 篇 化学工程与技术
- 61 篇 生物工程
- 55 篇 生物医学工程（可授...
- 51 篇 农业工程
- 46 篇 材料科学与工程（可...
- 43 篇 土木工程
- 40 篇 光学工程
- 29 篇 建筑学
2,404 篇 理学
- 1,983 篇 数学
- 312 篇 物理学
- 149 篇 统计学（可授理学、...
- 113 篇 系统科学
- 97 篇 生物学
- 89 篇 化学
506 篇 管理学
- 390 篇 管理科学与工程(可...
- 123 篇 图书情报与档案管...
- 76 篇 工商管理
81 篇 医学
- 58 篇 临床医学
67 篇 农学
- 62 篇 作物学
34 篇 经济学
- 32 篇 应用经济学
28 篇 法学
13 篇 文学
7 篇 教育学
5 篇 艺术学
4 篇 军事学

主题

9,174 篇 parallel algorit...
1,158 篇 concurrent compu...
847 篇 algorithm design...
672 篇 parallel process...
616 篇 computer science
460 篇 computational mo...
374 篇 computer archite...
289 篇 phase change ran...
233 篇 application soft...
224 篇 parallel archite...
215 篇 hypercubes
200 篇 very large scale...
198 篇 costs
196 篇 parallel program...
176 篇 sorting
175 篇 scalability
165 篇 hardware
152 篇 data mining
147 篇 routing
144 篇 clustering algor...

机构

26 篇 carnegie mellon ...
19 篇 school of electr...
17 篇 department of co...
17 篇 ibm thomas j. wa...
16 篇 department of co...
15 篇 old dominion uni...
15 篇 hiroshima univ d...
13 篇 purdue univ dept...
13 篇 univ texas dept ...
12 篇 georgia inst tec...
12 篇 univ maryland de...
12 篇 old dominion uni...
12 篇 school of comput...
11 篇 swiss fed inst t...
11 篇 univ maryland co...
11 篇 univ maryland in...
10 篇 georgia inst tec...
10 篇 department of co...
10 篇 department of co...
10 篇 eth zurich

作者

35 篇 shun julian
33 篇 olariu s
30 篇 p. banerjee
30 篇 blelloch guy e.
26 篇 nakano koji
24 篇 bader david a.
18 篇 dhulipala laxman
18 篇 gu yan
17 篇 ito yasuaki
16 篇 schwing jl
15 篇 v. kumar
15 篇 khan maleq
14 篇 sun yihan
14 篇 shi-jinn horng
14 篇 vishkin uzi
13 篇 ballard grey
13 篇 takefuji y
13 篇 banerjee p
13 篇 han yj
12 篇 ramachandran v

语言

8,734 篇 英文
360 篇 其他
60 篇 中文
9 篇 俄文
4 篇 德文
3 篇 西班牙文
2 篇 法文

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

共 9174 条记录，以下是371-380 订阅

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

详细简洁

排序：

Simple and Fast parallel algorithms for the Voronoi Map and the Euclidean Distance Map, with GPU implementations 46

Simple and Fast Parallel Algorithms for the Voronoi Map and ...

引用

46th International Conference on parallel Processing Workshops (ICPPW)

作者： Honda, Takumi Yamamoto, Shinnosuke Honda, Hiroaki Nakano, Koji Ito, Yasuaki Hiroshima Univ Dept Informat Engn Kagamiyama 1-4-1 Higashihiroshima 7398527 Japan

ISBN: (纸本)9781538610428

The complete Voronoi map of a binary image with black and white pixels is a matrix of the same size such that each element is the closest black pixel of the corresponding pixel. The complete Voronoi map visualizes the influence region of each black pixel. However, each region may not be connected due to exclave pixels. The connected Voronoi map is a modification of the complete Voronoi map so that all regions are connected. The Euclidean distance map of a binary image is a matrix, in which each element is the distance to the closest black pixel. It has many applications of image processing such as dilation, erosion, blurring effects, skeletonization and matching. The main contribution of this paper is to present simple and fast parallel algorithms for computing the complete/connected Voronoi maps and the Euclidean distance map and implement them in the GPU. Our parallel algorithm first computes the mixed Voronoi map, which is a mixture of the complete and connected Voronoi maps, and then converts it into the complete/connected Voronoi by exposing/hiding all exclave pixels. After that, the complete Voronoi map is converted into the Euclidean distance map by computing the distance to the closest black pixel for every pixel in an obvious way. The experimental results on GeForce GTX 1080 GPU show that the computing time for these conversions is relatively small. The throughput of our GPU implementation for computing the Euclidean distance maps of 2K x 2K binary images is up to 2.08 times larger than the previously published best GPU implementation, and up to 172 times larger than CPU implementation using Intel Core i7-4790.

关键词： Euclidean distance Graphics processing units parallel algorithms Instruction sets Phase change random access memory

来源：评论

学校读者我要写书评

暂无评论

Fringe analysis of synchronized parallel algorithms on 2-3 trees 2nd

Fringe analysis of synchronized parallel algorithms on 2-3 t...

引用

2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 98)

作者： BaezaYates, R Gabarró, J Messeguer, X Univ Chile Dept Ciencias Computac Santiago Chile Univ Politecn Catalunya Dept LSI Barcelona Spain

ISBN: (纸本)354065142X

We are interested in the fringe analysis of synchronized parallel insertion algorithms on 2-3 trees, namely the algorithm of W. Paul, U. Vishkin and H. Wagener (PVW). This algorithm inserts k keys into a tree of size n with parallel time O(log n + log K). Fringe analysis studies the distribution of the bottom subtrees and it is still an open problem for parallel algorithms on search trees. To tackle this problem we introduce a new kind of algorithms whose two extreme cases seems to upper and lower bounds the performance of the PVW algorithm. We extend the fringe analysis to parallel algorithms and we get a rich mathematical structure giving new interpretations even in the sequential case. The process of insertions is modeled by a Markov chain and the coefficients of the transition matrix are related with the expected local behavior of our algorithm. Finally we show that this matrix has a power expansion over (n+1)(-1) where the coefficients are the binomial transform of the expected local behavior. This expansion shows that the parallel case can be approximated by iterating the sequential case.

关键词： fringe analysis parallel algorithms 2-3 trees binomial transform

来源：评论

学校读者我要写书评

暂无评论

New parallel algorithms for frequent itemset mining in very large databases 15

New parallel algorithms for frequent itemset mining in very ...

引用

15th Symposium on Computer Architecture and High Performance Computing

作者： Veloso, A Meira, W Parthasarathy, S Univ Fed Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil

ISBN: (纸本)0769520464

Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of data in order to produce compact summaries or models of the database. These models are typically used to generate association rules, but recently they have also been used in far reaching domains like e-commerce and bio-informatics. Because databases are increasing in terms of both dimension (number of attributes) and size (number of records), one of the main issues in a frequent itemset mining algorithm is the ability to analyze very large databases. Sequential algorithms do not have this ability, especially in terms of run-time performance, for such very large databases. Therefore, we must rely on high performance parallel and distributed computing. We present new parallel algorithms for frequent itemset mining. Their efficiency is proven through a series of experiments on different parallel environments, that range from shared-memory multiprocessors machines to a set of SMP clusters connected together through a high speed network. We also briefly discuss an application of our algorithms to the analysis of large databases collected by a Brazilian web portal.

关键词： Algorithm design and analysis Association rules Data analysis Data mining Databases Distributed computing High-speed networks Itemsets parallel algorithms Runtime

来源：评论

学校读者我要写书评

暂无评论

Filterbank-based Fast parallel algorithms for Real-valued Discrete Gabor Expansion and Transform

Filterbank-based Fast Parallel Algorithms for Real-valued Di...

引用

International Symposium on Circuits and Systems Nano-Bio Circuit Fabrics and Systems (ISCAS 2010)

作者： Tao, Liang Kwan, H. K. Gu, Juan-juan Anhui Univ Sch Comp Sci & Technol Hefei 230039 Anhui Peoples R China Univ Windsor Dept Elect & Comp Engn Windsor ON N9B 3P4 Canada Hefei Univ Dept Elect Engn Hefei 230022 Peoples R China

ISBN: (纸本)9781424453092

Novel and fast parallel algorithms for the DHT-based real-valued discrete Gabor expansion (DGE) and discrete Gabor transform (DGT) are presented based on filterbanks. An analysis filterbank is designed for the DHT-based real-valued DGT and a synthesis filterbank is designed for the DHT-based real-valued DGE. The parallel channel in each of the two filterbanks has a unified structure and can apply the fast DHT (discrete Hartley transform) to reduce its computational load. The computational complexity of each parallel channel is very low and is independent of the oversampling rate. The computational complexity of the proposed parallel algorithms is analyzed and compared with that of the existing major parallel algorithms for the DGT and DGE. The results indicate that the proposed parallel algorithms are attractive for real time signal processing.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Time-optimal parallel algorithms for constructing optimal virtual cellular networks 9

Time-optimal parallel algorithms for constructing optimal vi...

引用

9th International Conference on parallel and Distributed Systems (ICPADS 2002)

作者： Zhang, JY Vrbsky, S Fan, GB Univ Alabama Dept Comp Sci Tuscaloosa AL 35487 USA

ISBN: (纸本)0769517609

In a cellular network, the base stations are not necessarily uniformly distributed, and their corresponding cell sizes are not necessarily the same. For example, a cell in a well-populated city cell is usually smaller than a cell in a rural area. To study a cellular network with non-uniform cell sizes, one approach is to use a virtual cellular network with a uniform cell size such that each virtual cell contains at most one base station. This paper has proposed parallel algorithms for meshes with multiple broadcasting to construct virtual mesh and honeycomb cellular networks for non-uniformly distributed base stations. The constructed virtual cellular networks are optimal in the sense that their corresponding uniform cell sizes reach the largest possible. The algorithms run in O(logn) time on a mesh with multiple broadcasting of size nxn to construct optimal virtual mesh and honeycomb cellular networks for n non-uniformly distributed base stations. Furthermore, those algorithms are time-optimal.

关键词： Base stations Broadcasting Cities and towns Computational modeling Computer architecture Computer science Land mobile radio cellular systems parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of parallel algorithms for path expression query in object database systems 7

Comparison of parallel algorithms for path expression query ...

引用

7th International Conference on Database Systems for Advanced Application (DASFAA 2001)

作者： Wang, GR Yu, G Kaneko, K Makinouchi, A Northeastern Univ Sch Informat Sci & Engn Shenyang 110006 Peoples R China

ISBN: (纸本)0769509967;0769509975

In this paper, We proposed a new parallel algorithm for computing path expression, named parallel Cascade Semijoin (PCSJ). Moreover, a new scheduling strategy called right-deep zigzag tree is designed to further improve the performance of the PCSJ algorithm. The experiments have been implemented in a NOW distributed and parallel environment. The results show that the PCSJ algorithm out-performs the other two parallel algorithms (the parallel version of forward pointer chasing algorithm (PFPC) and the index splitting parallel algorithm (IndexSplit)) when computing path expressions with restrictive predicates and that the right-deep zigzag tree scheduling strategy has the better performance that the right-deep tree scheduling strategy.

关键词： object databases path expressions parallel algorithms scheduling strategies

来源：评论

学校读者我要写书评

暂无评论

Randomized parallel algorithms for the multidimensional assignment problem

Randomized parallel algorithms for the multidimensional assi...

引用

3rd Workshop of the ERCIM-Working-Group-on-Matrix-Computations-and-Statitsics

作者： Oliveira, CAS Pardalos, PM Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA

The multidimensional assignment problem (MAP) is a combinatorial optimization problem arising in diverse applications such as computer vision and motion tracking. In the MAP, the objective is to match tuples of objects with minimum total cost. Randomized parallel algorithms are proposed to solve MAPs appearing in multi-sensor multi-target applications. A parallel construction heuristic is described, together with some variations, as well as a parallel local search heuristic. Experimental results using the proposed algorithms are discussed. (C) 2003 IMACS. Published by Elsevier B.V. All rights reserved.

关键词： multidimensional assignment problem parallel algorithms randomized algorithms heuristics

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithms for computing trigonometric sums

Fast parallel algorithms for computing trigonometric sums

引用

International Conference on parallel Computing in Electrical Engineering (PAR ELEC 2002)

作者： Stpiczynski, P Marie Curie Sklodowska Univ Dept Comp Sci PL-20031 Lublin Poland

ISBN: (纸本)0769517315

In this paper we present new parallel versions of sequential Goertzel and Reinsch algorithms for calculating trigonometric sums. The new algorithms use a recently introduced, very efficient BLAS-based algorithm for solving linear recurrence systems with constant coefficients. To achieve their portability across different shared-memory parallel architectures, the algorithms have been implemented in Fortran 77 and OpenMP. We also present experimental results performed on a two processor Pentium III computer running under Linux operating system with Atlas as an efficient implementation of BLAS. The new algorithms are up to 60-90% faster than the equivalent sequential Goertzel and Reinsch algorithms, even on one processor.

关键词： Character generation Clustering algorithms Computer science Concurrent computing Interpolation Linux Operating systems parallel algorithms parallel architectures Scientific computing

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering 21

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree...

引用

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Wang, Yiqiu Yu, Shangdi Gu, Yan Shun, Julian MIT CSAIL Cambridge MA 02139 USA UC Riverside Riverside CA USA

ISBN: (纸本)9781450383431

This paper presents new parallel algorithms for generating Euclidean minimum spanning trees and spatial clustering hierarchies (known as HDBSCAN*). Our approach is based on generating a well-separated pair decomposition followed by using Kruskal's minimum spanning tree algorithm and bichromatic closest pair computations. We introduce a new notion of well-separation to reduce the work and space of our algorithm for HDBSCAN*. We also give a new parallel divide-and-conquer algorithm for computing the dendrogram and reachability plots, which are used in visualizing clusters of different scale that arise for both EMST and HDBSCAN*. We show that our algorithms are theoretically efficient: they have work (number of operations) matching their sequential counterparts, and polylogarithmic depth (parallel time). We implement our algorithms and propose a memory optimization that requires only a subset of well-separated pairs to be computed and materialized, leading to savings in both space (up to 10x) and time (up to 8x). Our experiments on large real-world and synthetic data sets using a 48-core machine show that our fastest algorithms outperform the best serial algorithms for the problems by 11.13-55.89x, and existing parallel algorithms by at least an order of magnitude.

关键词： parallel algorithms shared memory algorithms clustering

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of parallel algorithms for pricing multidimensional financial derivatives

Performance evaluation of parallel algorithms for pricing mu...

引用

31st International Conference on parallel Processing (ICPP 2002)

作者： Thulasiram, RK Bondarenko, DA Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada

ISBN: (纸本)0769516807

In this paper, we develop parallel algorithms for pricing a class of multidimensional financial derivatives employing binomial lattice approach. We describe the algorithms, explain their complexities, and study their performance. The limitations posed by the problem size on the recursive algorithm and the solution to overcome this problem by the iterative algorithm are explained through the experimental results using MPL We first present analytical results for the number of computations and communications for both the algorithms. Since the number of nodes in a recombining lattice grows linearly with the problem size, it is feasible to price long-dated options using a recombining lattice. We have extended our algorithm to handle derivatives with many underlying assets and shown that the multi-asset derivatives offer a better problem for parallel computation. This is very important for finance industry since long-dated derivatives with many underlying assets are common in practice.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：