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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

462 篇 会议
17 册 图书
9 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

205 篇 工学
- 151 篇 计算机科学与技术...
- 57 篇 电气工程
- 52 篇 信息与通信工程
- 51 篇 软件工程
- 17 篇 控制科学与工程
- 11 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 动力工程及工程热...
- 5 篇 仪器科学与技术
- 4 篇 光学工程
- 4 篇 测绘科学与技术
- 4 篇 生物工程
- 3 篇 化学工程与技术
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
72 篇 理学
- 53 篇 数学
- 13 篇 物理学
- 9 篇 统计学（可授理学、...
- 8 篇 系统科学
- 6 篇 生物学
- 2 篇 化学
- 2 篇 地球物理学
17 篇 管理学
- 9 篇 图书情报与档案管...
- 7 篇 管理科学与工程(可...
- 5 篇 工商管理
6 篇 医学
- 6 篇 临床医学
3 篇 法学
- 3 篇 社会学
2 篇 经济学
- 2 篇 应用经济学
1 篇 教育学
1 篇 农学

主题

109 篇 complexity theor...
100 篇 computational co...
33 篇 time complexity
28 篇 algorithm design...
25 篇 computational mo...
23 篇 heuristic algori...
22 篇 prediction algor...
22 篇 accuracy
19 篇 feature extracti...
18 篇 classification a...
18 篇 clustering algor...
18 篇 partitioning alg...
17 篇 encoding
16 篇 approximation al...
15 篇 optimization
15 篇 signal processin...
14 篇 decoding
14 篇 genetic algorith...
14 篇 algorithm analys...
12 篇 detectors

机构

4 篇 university of pi...
3 篇 inria rennes
2 篇 vienna universit...
2 篇 school of comput...
2 篇 computer network...
2 篇 tu münchen garch...
2 篇 computer science...
2 篇 faculty of engin...
2 篇 isislab - dipart...
2 篇 key laboratory o...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...
2 篇 department of co...
2 篇 universitat poli...
2 篇 vilnius universi...
2 篇 cracs/inesc-tec ...
2 篇 beihang universi...
2 篇 tech univ munich...
2 篇 tu dortmund info...
2 篇 universidad carl...

作者

4 篇 dell'orletta fel...
3 篇 liu yang
3 篇 tingting yang
3 篇 carlos a. coello...
2 篇 ming li
2 篇 yuhui shi
2 篇 michael alexande...
2 篇 holzapfel klaus
2 篇 zhiyang li
2 篇 roberto g. casce...
2 篇 bollig beate
2 篇 geyong min
2 篇 zorzi michele
2 篇 wanlei zhou
2 篇 ali hamzeh
2 篇 strada roberto
2 篇 alexandru costan
2 篇 luís lopes
2 篇 brunato dominiqu...
2 篇 emmanuel jeannot

语言

484 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=5th Italian Conference on Algorithms and Complexity"

共 488 条记录，以下是151-160 订阅

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

详细简洁

排序：

BFrWF: Block-based FrWF for coding of high-resolution images with memory-complexity constrained-devices 5

BFrWF: Block-based FrWF for coding of high-resolution images...

引用

5th IEEE Uttar Pradesh Section International conference on Electrical, Electronics and Computer Engineering (UPCON)

作者： Tausif, Mohd Khan, Ekram Hasan, Mohd AMU Dept Elect Engn ZHCET Aligarh Uttar Pradesh India

ISBN: (纸本)9781538650028

A typical image coder generally consists of a transform stage followed by quantization and coding stages. the memory requirement of an image coder would be the maximum of both the stages and complexity would be the sum of both stages. Due to large memory requirements, most of the existing image coders are unsuitable for their implementation on memory-constrained-platforms especially for high-resolution images. In this paper, we propose a low memory approach, Block-based Fractional Wavelet Filter (BFrWF), to compute wavelet transform coefficients of high-resolution images. Furthermore, BFrWF can be combined with low memory wavelet-based image coding algorithms to design low-memory image codec. Evaluation results show that the BFrWF requires less than 10 kB of RAM (available over most of the low-cost sensor nodes) even for high-resolution (HR) images, thus making it suitable for visual sensor networks. Moreover, the proposed BFrWF implemented with 8 blocks has 25.64% less complexity than FrWF and 80.45% less complexity than segmented FrWF (SFrWF) implemented with partitioning of an image line into 8 segments (SFrWF-a low memory variant of FrWF) for HR-image of dimension 2048x2048.

关键词： Image coder low memory Discrete Wavelet Transform Fractional wavelet filter and sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Pruning the algorithm complexity of the Add-Compare Select Unit (ACSU) for the Viterbi Decoder - A Review 5

Pruning the algorithm complexity of the Add-Compare Select U...

引用

5th IEEE International conference on Smart Instrumentation, Measurement and Application (ICSIMA)

作者： Rashid, Ruhaida Abdul Harun, Harlisya Mansor, Zuhanis Shamsudin, Norfadilah Nor, Sahzilawati Mohamed Univ Kuala Lumpur Malaysian Inst Aviat Technol UniKL MIAT Lot 2891Jalan Jenderam Hulu Dengkil 43800 Selangor Malaysia Univ Kuala Lumpur British Malaysian Inst UniKL BMI Batu 8Jalan Sungai Pusu Gombak 53100 Malaysia

ISBN: (纸本)9781538662885

Viterbi decoders are widely employed along with convolutional encoders to provide an excellent error correction probability in digital wireless transmissions. To achieve lower error rates, the constraint length (k) of the encoder, has to be defined at higher values. However, higher (k) results in increasingly complex implementations of the Viterbi algorithm. As a result, the power consumption of the Viterbi decoder will increase exponentially which is to the disadvantage of many wireless communication devices. Many reduced complexity decoding techniques of the Viterbi decoder presented in the past focused on algorithm and architecture specific levels. Most of the studies concentrated on the Add-Compare Select Unit (ACSU) of the decoder, due to its nature of repetitive processing;also add to the complexity of the process. this paper presents a review of several variations of the Viterbi algorithm performed in the ACSU. the comparison was made among several different algorithms with the most optimal algorithm presented in this paper. A combined algorithm approach is proposed at the end of the review for future improvement.

关键词： adaptive viterbi decoder adaptive M-algorithm convolutional encoder constraint length forward error correction trellis diagram

来源：评论

学校读者我要写书评

暂无评论

A Low complexity Joint Detection and Decoding Algorithm for MIMO-LDPC System

A Low Complexity Joint Detection and Decoding Algorithm for ...

引用

International conference on Computer and Communications (ICCC)

作者： Jiansong Miao Yanyong Fan Haoqiong Yin Ningyu Chen Weijie Li Beijing Laboratory of Advanced Information Networks Beijing University of Posts and Telecommunications Beijing China Innovation R&D Center China Satellite Communications Co. Ltd Beijing China

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

Joint detection and decoding (JDD) algorithm has recently received extensive attention due to its excellent performance. Responding to the requirements of the 5thgeneration communication system with high rate and low latency, a low complexity joint detection and decoding (LCJDD) algorithm for MIMO-LDPC system has been proposed. the computational complexity of the proposed algorithm is significantly lower than that of systems using JDD blocks, and the performance loss can be controlled to be within about 0.5 dB.

关键词： Parity check codes complexity theory MIMO communication Decoding Heuristic algorithms Modulation Decision trees

来源：评论

学校读者我要写书评

暂无评论

LINGOBLM: using LINGO kernel in Bipartite Local Model

LINGOBLM: using LINGO kernel in Bipartite Local Model

引用

International conference on Knowledge-Based Engineering and Innovation (KBEI)

作者： Faraneh haddadi Mohammad Reza Keyvanpour Department of Computer Engineering and Data mining laboratory Alzahra University Tehran Iran Department of Computer Engineering Alzahra University Tehran Iran

Predicting potential drug-target interactions from heterogeneous biological data could benefit novel drugs discovery and improve human medicine. Computational prediction is a suitable alternative for the traditional time-consuming and expensive experimental process of drug-target interactions prediction. New computational drug-target interactions prediction approaches are divided into two categories: machine learning-based and network-based. In this paper, we extended the Bipartite Local Model (BLM), one of the most well-known approaches for predicting drug-target interactions. BLM has a high computational complexity due to the use of a two-dimensional kernel for the drug side. Instead, we used LINGO, a one-dimensional kernel, to calculate the similarity between drugs. In order to compare our work with previously published results, we performed experiments using publicly available real-world drug-target interactions datasets. the results suggested that our approach is competitive and outperformed BLM.

关键词： Drugs Kernel Predictive models Proteins Computational modeling Prediction algorithms Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval 5

Maximum Lateness Minimization on Two-Parallel Machine with a...

引用

5th International conference on Control, Decision and Information Technologies (CoDIT)

作者： Alhadi, Gais Kacem, Imed Laroche, Pierre Osman, Izzeldin M. Univ Gezira Fac Math & Comp Sci Wad Madani Sudan Univ Lorraine LCOMS Lab F-57045 Metz France Sudan Univ Sci & Technol Khartoum Sudan

ISBN: (纸本)9781538650653

In this paper, we consider the two-parallel machine scheduling problem with a non-availability interval. We aim to minimize the maximum lateness when every job has a positive tail. We show that the problem has a constant polynomial approximation algorithm. We present a dynamic programming algorithm and we show that the problem has an FPTAS (Fully Polynomial Time Approximation Algorithm). the proposed FPTAS has a strongly polynomial running time. Finally, we present some numerical experiments and we analyze the obtained results.

关键词： Approximation algorithms Heuristic algorithms Dynamic programming Single machine scheduling Optimized production technology Schedules complexity theory

来源：评论

学校读者我要写书评

暂无评论

Advanced Isomap Based on Data Nuggets Algorithm

Advanced Isomap Based on Data Nuggets Algorithm

引用

International conference on Computer and Communications (ICCC)

作者： Yating Liu Department of Statistics Rutgers University Piscataway United States

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

Manifold learning is a recent popular approach to find the internal low-dimensional structure from the high-dimensional nonlinear data sets embedded in the European space. It is based on the idea that the data we can observe are actually mapped from a low-dimensional space to a high-dimensional one. Given the limitation of the internal characteristics of the data, those artificial high-dimensional data produce dimensional redundancy. In fact, these data can be represented in the lower-dimension space. algorithms for this task are to achieve efficient and accurate data analysis results. After studying some common algorithms purposed for manifold learning, we find that there is still an improvement for their efficiency. To be specific, in order to reduce computational complexity of the Isometrical Mapping, we introduce a new solution through the concept of data nuggets” to do data partition and selection. this concept is to reduce a large dataset into a smaller set of nuggets of data, each of which contains a center, weight and a scale parameter. While the data is re-expressed as data nuggets, we can apply algorithms for Isomap. this combination can largely reduce the computational complexity due to the decreased dataset. Meanwhile, it still maintains the advantages of Isomap that keep the geodesic distances between the points unchanged.

关键词： Manifolds Computational complexity Dimensionality reduction Principal component analysis Partitioning algorithms Data visualization

来源：评论

学校读者我要写书评

暂无评论

Lexicon and Syntax: complexity across genres and language varieties 5

Lexicon and Syntax: Complexity across genres and language va...

引用

5th italian conference on Computational Linguistics, CLiC-it 2018

作者： Dell'Oglio, Pietro Brunato, Dominique Dell'Orletta, Felice University of Pisa Italy ItaliaNLP Lab. Italy

this paper presents first results of an ongoing work to investigate the interplay between lexical complexity and syntactic complexity with respect to nominal lexicon and how it is affected by textual genre and level of linguistic complexity within genre. A cross-genre analysis is carried out for the italian language using multi-leveled linguistic features automatically extracted from dependency parsed corpora. © 2018 CEUR-WS. All rights reserved.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

A General Decoder Architecture for LDPC and Polar Codes on Sparse Bipartite Graphs

A General Decoder Architecture for LDPC and Polar Codes on S...

引用

IEEE International conference on Computer and Communications

作者： Yuwei Wang Hui Yu Weibing Wang Deren of Eecronic Engineering Shnghi Jio Tong UniversiyDeren of Eecronic Engineering Shnghi Jio Tong UniversiyMorningcore Technoogy Co. Ld.

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

this paper presents a general decoder architecture for 5G LDPC and polar codes. To achieve the hardware reuse maximization, both LDPC and polar codes are decoded by belief propagation (BP) algorithm on sparse bipartite graphs. However, by counting the number of short cycles on the polar bipartite graphs, we observe that numerous short cycles cause the poor performance than conventional decoding algorithms, like successive cancellation (SC) and BP decoding. To reduce the impact of short cycles, a LDPC-like BP list (BPL) decoding algorithm is proposed for polar codes, which is applied on L different polar bipartite graphs constructed by different permuted polar factor graphs. Finally, the simulation shows that the proposed general decoder for polar codes can obtain beyond SC and BP error performance with lower decoding latency and computational complexity, and even near successive cancellation list (SCL) performance in high signal-noise ratios (SNRs).

关键词： Decoding Bipartite graph Iterative decoding Computer architecture 5G mobile communication Hardware

来源：评论

学校读者我要写书评

暂无评论

Generalized Fast Decoding of Polar Codes

Generalized Fast Decoding of Polar Codes

引用

IEEE Global conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Condo, Carlo Bioglio, Valerio Land, Ingmar Department of Information Engineering National Defense University

ISBN: (纸本)9781538647271

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have been selected as one of the coding schemes in the 5th generation wireless standard (SG). Over the years various polar code decoding algorithms, like SC-list (SCL), have been proposed to improve the mediocre performance of the successive cancellation (SC) decoding algorithm for finite code lengths;however, like SC, they suffer from long decoding latency. Fast decoding of polar codes tries to overcome this problem by identifying particular subcodes in the polar code and decoding them with efficient decoders. In this work, we introduce a generalized approach to fast decoding of polar codes to further reduce SC-based decoding latency. We propose three multi-node polar code subcodes whose identification patterns include most of the existing subcodes, extending them to SCL decoding, and allow to apply fast decoding to larger subsets of bits. Without any error-correction performance degradation, the proposed technique shows up to 23.6% and 29.2% decoding latency gain with respect to fast SC and SCL decoding algorithms, respectively, and up to 63.6% and 49.8% if a performance loss is accepted, whose amount depends on code and decoding algorithm parameters, along with the desired speedup.

关键词： Decoding complexity theory Encoding 5G mobile communication Parity check codes Reliability

来源：评论

学校读者我要写书评

暂无评论

Research and Improvement of a Pattern Matching Algorithm Based on BNDM

Research and Improvement of a Pattern Matching Algorithm Bas...

引用

International conference on Computer and Communications (ICCC)

作者： Yansen Zhou Fengyuan Shi Department of Information Science and Technology University of International Relations Beijing China

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

the improvement of the time performance of a pattern matching algorithm mainly lies in reducing the number of character comparisons and increasing the distance of text string matching window moving to the right when mismatch occurs. To solve these problems, an improved algorithm based on the combination of word frequency, BNDM and BMHS2 is proposed. Firstly, in order to reduce the number of character comparisons in each matching window, a matching algorithm based on word frequency is introduced; Secondly, in order to improve the moving distance of matching window, BMHS2 and BNDM algorithms are introduced. when mismatch occurs, the matching window is moved to the right by using a large jump distance in BNDM and BMHS2 algorithms. Finally, the time performance of the three algorithms is tested and compared by multiple experiments. Experimental results show that the improved pattern matching algorithm I_BNDM_BMHS2 improves the matching time performance to some extent compared with BNDM and BMHS2 algorithms under the same experimental conditions.

关键词： Pattern matching Time-frequency analysis Time complexity Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：