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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

616 篇 会议
75 册 图书
5 篇 期刊文献

馆藏范围

696 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

380 篇 工学
- 326 篇 计算机科学与技术...
- 231 篇 软件工程
- 96 篇 信息与通信工程
- 64 篇 控制科学与工程
- 61 篇 生物工程
- 48 篇 生物医学工程（可授...
- 42 篇 电气工程
- 37 篇 仪器科学与技术
- 27 篇 光学工程
- 27 篇 石油与天然气工程
- 23 篇 化学工程与技术
- 20 篇 电子科学与技术（可...
- 19 篇 机械工程
- 13 篇 环境科学与工程（可...
- 13 篇 安全科学与工程
- 12 篇 交通运输工程
198 篇 理学
- 104 篇 数学
- 66 篇 生物学
- 46 篇 化学
- 32 篇 物理学
- 26 篇 统计学（可授理学、...
- 16 篇 系统科学
101 篇 管理学
- 71 篇 图书情报与档案管...
- 58 篇 管理科学与工程(可...
- 21 篇 工商管理
41 篇 医学
- 23 篇 临床医学
- 18 篇 基础医学(可授医学...
- 15 篇 药学(可授医学、理...
- 15 篇 特种医学
14 篇 法学
- 11 篇 社会学
9 篇 教育学
8 篇 农学
7 篇 经济学
1 篇 艺术学

主题

79 篇 pattern recognit...
48 篇 artificial intel...
33 篇 computer imaging...
26 篇 computer applica...
25 篇 machine learning
23 篇 computer vision
18 篇 data mining and ...
18 篇 image processing...
16 篇 image segmentati...
16 篇 data mining
16 篇 computer systems...
16 篇 layout
15 篇 optical computin...
15 篇 shape
14 篇 deep learning
14 篇 feature extracti...
12 篇 pattern matching
12 篇 computer communi...
11 篇 concurrent compu...
11 篇 information stor...

机构

32 篇 shenyang institu...
27 篇 university of ch...
21 篇 shenyang institu...
8 篇 chitkara univers...
7 篇 school of comput...
7 篇 chinese academy ...
6 篇 fujian key labor...
6 篇 guangdong univer...
6 篇 tsinghua univers...
6 篇 zhejiang univers...
6 篇 central south un...
6 篇 unsw sydney
6 篇 university of ch...
5 篇 engineering rese...
5 篇 university of te...
5 篇 dalian universit...
5 篇 university of sy...
5 篇 the 54th researc...
5 篇 institute of aut...
5 篇 school of engine...

作者

10 篇 hornegger joachi...
6 篇 zheng-guang wu
6 篇 hongyi li
6 篇 chaojie li
6 篇 biao luo
6 篇 yu bihui
6 篇 long cheng
5 篇 yihe zhang
5 篇 aiming wu
5 篇 zhou xiaolei
5 篇 baohua qiang
5 篇 hui huang
5 篇 tiwari raj gaura...
5 篇 da-han wang
5 篇 jing dong
5 篇 ajith abraham
5 篇 jiwen lu
5 篇 yongjie yang
5 篇 agarwal ambuj ku...
5 篇 risheng liu

语言

687 篇 英文
6 篇 其他
3 篇 中文

检索条件"任意字段=Proceedings of the 2023 12th International Conference on Computing and Pattern Recognition"

共 696 条记录，以下是541-550 订阅

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

详细简洁

排序：

Parallel leap: Large-scale maximal pattern mining in a distributed environment

Parallel leap: Large-scale maximal pattern mining in a distr...

引用

12th international conference on Parallel and Distributed Systems, ICPADS 2006

作者： El-Hajj, Mohammad Zaïane, Osmar R. Department of Computing Science University of Alberta Edmonton Alta. Canada

ISBN: (纸本)0769526128

When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets due to their sheer size;not only the extent of the existing patterns, but mainly the magnitude of the search space. Many approaches have been suggested such as sequential mining for maximal patterns or searching for all frequent patterns in parallel. So far, those approaches are still not genuinely effective to mine extremely large datasets. In this work we propose a method that combines both strategies efficiently, i.e. mining in parallel for the set of maximal patterns which, to the best of our knowledge, has never been proposed efficiently before. Using this approach we could mine significantly large datasets;with sizes never reported in the literature before. We are able to effectively discover frequent patterns in a database made of billion transactions using a 32 processors cluster in less than 2 hours. © 2006 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation

Non-contiguous processor allocation strategy for 2D mesh con...

引用

12th international conference on Parallel and Distributed Systems, ICPADS 2006

作者： Bani-Mohammad, S. Ould-Khaoua, M. Ababneh, I. Mackenzie, Lewis M. Glasgow University Computing Science Glasgow G12 8RZ United Kingdom Al Al-bayt University Computing Science Mafraq 25113 Jordan

ISBN: (纸本)0769526128

Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and has the same topology as the network topology connecting these processors. In non-contiguous allocation, a job can execute on multiple disjoint smaller sub-meshes rather than always waiting until a single sub-mesh of the requested size is available. Lifting the contiguity condition in non-contiguous allocation is expected to reduce processor fragmentation and increase processor utilization. However, the communication overhead is increased because the distances traversed by messages can be longer. the extra communication overhead depends on how the allocation request is partitioned and allocated to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network, and is compared using simulation against the well-known non-contiguous and contiguous allocation strategies. To show the performance improved by proposed strategy, we conducted simulation runs under the assumption of wormhole routing and all-to-all communication pattern. the results show that the proposed strategy can reduce the communication overhead and improve performance substantially in terms of turnaround times of jobs and finish times. © 2006 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Discovering significant OPSM subspace clusters in massive gene expression data 06

Discovering significant OPSM subspace clusters in massive ge...

引用

KDD 2006: 12th ACM SIGKDD international conference on Knowledge Discovery and Data Mining

作者： Gao, Byron J. Griffith, Obi L. Ester, Martin Jones, Steven J. M. School of Computing Science Simon Fraser University Canada Genome Sciences Centre British Columbia Cancer Agency Canada

ISBN: (纸本)1595933395

Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of conditions. In an OPSM, the expression levels of all genes induce the same linear ordering of the conditions. OPSM mining is reducible to a special case of the sequential pattern mining problem, in which a pattern and its supporting sequences uniquely specify an OPSM cluster. those small twig clusters, specified by long patterns with naturally low support, incur explosive computational costs and would be completely pruned off by most existing methods for massive datasets containing thousands of conditions and hundreds of thousands of genes, which are common in today's gene expression analysis. However, it is in particular interest of biologists to reveal such small groups of genes that are tightly coregulated under many conditions, and some pathways or processes might require only two genes to act in concert. In this paper, we introduce the KiWi mining framework for massive datasets, that exploits two parameters k and w to provide a biased testing on a bounded number of candidates, substantially reducing the search space and problem scale, targeting on highly promising seeds that lead to significant clusters and twig clusters. Extensive biological and computational evaluations on real datasets demonstrate that KiWi can effectively mine biologically meaningful OPSM subspace clusters with good efficiency and scalability. Copyright 2006 ACM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Using B-spline curves for hand recognition

Using B-spline curves for hand recognition

引用

17th international conference on pattern recognition (ICPR)

作者： Ma, YL Pollick, F Hewitt, WT Univ Glasgow Dept Psychol Glasgow G12 8QB Lanark Scotland

ISBN: (纸本)0769521282

the B-Spline curve and surface provide an accurate tool to record object shape. We present a biometric identification system through hand geometry measurements by using B-Spline curves. We use 4 B-Spline curves to fit with fingers (except thumb) from a single hand image for a single person. then we store these 4 curves as well as other geometry measurements of the hand as the "signature" of that person into the database. By computing the differences between the curves from database hand images and the curves from the query hand image using the point projection method, we are able to verify/identify the person by locating the closest database hand image to the query hand image.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Content-based music structure analysis with applications to music semantics understanding

Content-based music structure analysis with applications to ...

引用

ACM Multimedia 2004 - proceedings of the 12th ACM international conference on Multimedia

作者： Maddage, Namunu C. Xu, Changsheng Kankanhalli, Mohan S. Shao, Xi Institute for Infocomm Research 21 Heng Mui Keng Terrace Singapore 119613 Singapore School of Computing National University of Singapore Singapore 117543 Singapore

ISBN: (纸本)1581138938

In this paper, we present a novel approach for music structure analysis. A new segmentation method, beat space segmentation, is proposed and used for music chord detection and vocal/instrumental boundary detection. the wrongly detected chords in the chord pattern sequence and the misclassified vocal/instrumental frames are corrected using heuristics derived from the domain knowledge of music composition. Melody-based similarity regions are detected by matching sub-chord patterns using dynamic programming. the vocal content of the melody-based similarity regions is further analyzed to detect the content-based similarity regions. Based on melody-based and content-based similarity regions, the music structure is identified. Experimental results are encouraging and indicate that the performance of the proposed approach is superior to that of the existing methods. We believe that music structure analysis can greatly help music semantics understanding which can aid music transcription, summarization, retrieval and streaming.

关键词： Computer music

来源：评论

学校读者我要写书评

暂无评论

CDHT: the design of a clustered DHT routing scheme for serverless (P2P) networks

CDHT: the design of a clustered DHT routing scheme for serve...

引用

IEEE international conference on Networks

作者： W. Ye A.I. Khan E.A. Kendall School of Network Computing Monash University Frankston VIC Australia

Avoiding hot spots and handling dynamic network environments are the inherent weaknesses of the DHT-based (dynamic hash table) p2p networks. the solution lies in isolating the DHT overlay from the network uncertainty and seeking an efficient and complementary lookup pattern outside the DHT. We present the design of a hybrid-overlay architecture for p2p networks in this paper that forms the DHT overlay based on the serverless layer clusters. the architecture delegates the handling of the network uncertainty to the network-aware serverless Layer; thus a more reliable network and content structure is constructed as the foundation of the DHT overlay. In addition, a new heuristic approach to content location is made possible to exploit network proximity and content popularity to balance network traffic and to improve the lookup efficiency for popular content.

关键词： Routing Peer to peer computing Uncertainty Telecommunication traffic Scalability Load management Computer networks Information technology Australia Joining processes

来源：评论

学校读者我要写书评

暂无评论

Advantages of using a space filling curve for computing wavelet transforms of road traffic images

Advantages of using a space filling curve for computing wave...

引用

12th international conference on Image Analysis and Processing

作者： Pamula, W Silesian Tech Univ Fac Transport PL-40019 Katowice Poland

ISBN: (纸本)0769519482

the properties of computing wavelet transforms of road traffic image data are discussed. It is proposed to incorporate Hilbert scan of image data and a wavelet transform factorised into lifting steps. Scanning an image, in space filling curve order, brings together pixels that are highly correlated. this is a desirable property, because the objects of interest - vehicles comprise a bounded set of regular patches on an image. Applying a 1-dimensional wavelet transform requires a smaller number of processing steps than a separable two-dimensional transform. Such a solution is suitable for on site microcontroler or FPGA implementation.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 12th IEEE international conference on Fuzzy Systems (Cat. No.03CH37442)

Proceedings of the 12th IEEE International Conference on Fuz...

引用

IEEE international conference on Fuzzy Systems (FUZZ-IEEE)

the following topics are dealt with: fuzzy logic; control; mobile robots; optimization; computing with words; human interfaces; neural networks and evolutionary hybrids; data mining; information retrieval; pattern rec...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Attributed skeletal graphs for shape modelling and matching

Attributed skeletal graphs for shape modelling and matching

引用

international conference on Image Analysis and Processing

作者： C. Di Ruberto Dipartimento di Matematica e Informatica Universitá di Cagliari Cagliari Italy

the aim of this paper is mainly on using the potential strength of the skeleton of discrete objects in computer vision and pattern recognition. We propose to represent the medial axis characteristic points as an attributed skeletal graph to model the shape. the information about the object shape and its topology is totally embedded in them and this allows the comparison of different objects by graph matching algorithms. the experimental results demonstrate the correctness in detecting its characteristic points and in computing a more regular and effective representation for a perceptual indexing. the matching process, based on a revised graduated assignment algorithm, has produced encouraging results, showing the potential of the developed method in a variety of computer vision and pattern recognition domains. the results demonstrate its robustness in the presence of scale, reflection and rotation transformations and prove the ability to handle noise and occlusions.

关键词： Shape Skeleton Indexing Topology Computer vision pattern recognition Image analysis pattern matching Noise robustness Acoustic reflection

来源：评论

学校读者我要写书评

暂无评论

Components analysis of hidden Markov models in computer vision

Components analysis of hidden Markov models in computer visi...

引用

international conference on Image Analysis and Processing

作者： T. Caelli B. McCane Department of Computing Science University of Algarve Edmonton AB Canada University of Otago Dunedin New Zealand

Hidden Markov models (HMMs) have become a standard tool for pattern recognition in computer vision. Although parameter and topology estimation have been studied, and still are, detailed analysis of how these estimated parameters contribute to HMM performance is rarely addressed. We develop tools for measuring such contributions and illustrate key issues in a representative task of gesture recognition - 3D motion recovery from 2D projections.

关键词： Hidden Markov models Computer vision Image analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共70页 << < 51 52 53 54 55 56 57 58 59 60 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：