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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

458 篇 会议
24 篇 期刊文献
18 册 图书

馆藏范围

499 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

323 篇 工学
- 254 篇 计算机科学与技术...
- 142 篇 软件工程
- 52 篇 电气工程
- 44 篇 信息与通信工程
- 34 篇 土木工程
- 20 篇 生物医学工程（可授...
- 17 篇 建筑学
- 16 篇 材料科学与工程（可...
- 15 篇 控制科学与工程
- 13 篇 仪器科学与技术
- 12 篇 机械工程
- 11 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 测绘科学与技术
- 10 篇 生物工程
- 6 篇 化学工程与技术
113 篇 理学
- 68 篇 数学
- 22 篇 物理学
- 20 篇 生物学
- 13 篇 统计学（可授理学、...
- 9 篇 化学
- 7 篇 地质学
- 7 篇 系统科学
- 6 篇 地球物理学
43 篇 管理学
- 23 篇 图书情报与档案管...
- 22 篇 管理科学与工程(可...
- 10 篇 工商管理
23 篇 医学
- 18 篇 临床医学
- 9 篇 特种医学
- 7 篇 医学技术（可授医学...
4 篇 农学
3 篇 经济学
3 篇 法学
3 篇 教育学
3 篇 文学

主题

105 篇 data structures
36 篇 data mining
22 篇 computer science
17 篇 clustering algor...
12 篇 algorithms
12 篇 internet
12 篇 algorithm design...
10 篇 structural healt...
10 篇 classification a...
10 篇 data models
9 篇 computer archite...
9 篇 image segmentati...
9 篇 protocols
9 篇 hardware
9 篇 algorithm analys...
9 篇 partitioning alg...
8 篇 discrete mathema...
8 篇 databases
7 篇 scalability
7 篇 deep learning

机构

5 篇 fujian prov univ...
5 篇 hubei univ techn...
4 篇 microsoft resear...
3 篇 chandigarh unive...
3 篇 wuhan fiberhome ...
2 篇 univ michigan an...
2 篇 institute of aer...
2 篇 engineer dxc tec...
2 篇 fermilab natl ac...
2 篇 southwest jiaoto...
2 篇 department of co...
2 篇 lovely professio...
2 篇 univ maryland de...
2 篇 int hellen univ ...
2 篇 aeronautics-tech...
2 篇 peking univ ctr ...
2 篇 lloyd institute ...
2 篇 nci frederick ca...
2 篇 college of engin...
2 篇 heriot watt univ...

作者

5 篇 ye zhiwei
3 篇 lehner wolfgang
2 篇 shatsky maxim
2 篇 monaco ernesto
2 篇 montenegro manue...
2 篇 catthoor francky
2 篇 scholz sven-bodo
2 篇 napoli amedeo
2 篇 tjortjis christo...
2 篇 chen chen
2 篇 thiele maik
2 篇 weifeng lv
2 篇 fischer ulrike
2 篇 yan lingyu
2 篇 praveen
2 篇 saxena sanjeev
2 篇 dror oranit
2 篇 tongyu zhu
2 篇 wolfson haim j.
2 篇 ouyang cheng

语言

491 篇 英文
4 篇 其他
2 篇 俄文
2 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Workshop on Algorithms and Data Structures"

共 500 条记录，以下是211-220 订阅

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

详细简洁

排序：

10th international workshop on Clinical Image-Based Procedures, CLIP 2021, 2nd MICCAI workshop on Distributed and Collaborative Learning, DCL 2021, 1st MICCAI workshop, LL-COVID19, 1st Secure and Privacy-Preserving Machine Learning for Medical Imaging workshop and Tutorial, PPML 2021, held in conjunction with 24th international Conference on Medical Image Computing and Computer Assisted Intervention, MICCAI 2021

10th International Workshop on Clinical Image-Based Procedur...

引用

10th international workshop on Clinical Image-Based Procedures, CLIP 2021, 2nd MICCAI workshop on Distributed and Collaborative Learning, DCL 2021, 1st MICCAI workshop, LL-COVID19, 1st Secure and Privacy-Preserving Machine Learning for Medical Imaging workshop and Tutorial, PPML 2021, held in conjunction with 24th international Conference on Medical Image Computing and Computer Assisted Intervention, MICCAI 2021

ISBN: (纸本)9783030908737

the proceedings contain 17 papers. the special focus in this conference is on Clinical Image-Based Procedures. the topics include: DCL preface;LL-COVID-19 preface;PPML preface;intestine Segmentation with Small Computational Cost for Diagnosis Assistance of Ileus and Intestinal Obstruction;multi-task Federated Learning for Heterogeneous Pancreas Segmentation;federated Learning in the Cloud for Analysis of Medical Images - Experience with Open Source Frameworks;on the Fairness of Swarm Learning in Skin Lesion Classification;Lessons Learned from the Development and Application of Medical Imaging-Based AI Technologies for Combating COVID-19: Why Discuss, What Next;the Role of Pleura and Adipose in Lung Ultrasound AI;DuCN: Dual-Children Network for Medical Diagnosis and Similar Case Recommendation Towards COVID-19;data Imputation and Reconstruction of Distributed Parkinson’s Disease Clinical Assessments: A Comparative Evaluation of Two Aggregation algorithms;defending Medical Image Diagnostics Against Privacy Attacks Using Generative Methods: Application to Retinal Diagnostics;generation of Patient-Specific, Ligamentoskeletal, Finite Element Meshes for Scoliosis Correction Planning;Bayesian Graph Neural Networks for EEG-Based Emotion Recognition;ViTBIS: Vision Transformer for Biomedical Image Segmentation;Attention-Guided Pancreatic Duct Segmentation from Abdominal CT Volumes;development of the Next Generation Hand-Held Doppler with Waveform Phasicity Predictive Capabilities Using Deep Learning;learning from Mistakes: An Error-Driven Mechanism to Improve Segmentation Performance Based on Expert Feedback.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Classification of defaced occlusion plates based on convolutional neural network 5

Classification of defaced occlusion plates based on convolut...

引用

5th international workshop on Pattern Recognition

作者： Sen, Zhang Zhang Jingle Jie, Li Shuai, Chen Minist Publ Secur Traff Management Res Inst 88 Qianrong Rd Wuxi 214151 Jiangsu Peoples R China Beijing Huizhi Data Technol Co Court 1 Upland 10th St Beijing 100085 Peoples R China

ISBN: (纸本)9781510638648

As one of the important components of intelligent transportation, license plate recognition plays an irreplaceable role in people's daily life. For example, illegal vehicles often escape from punishment because of the number plate defacement or intentional occlusion, which further increases the difficulty of law enforcement. therefore, it is significant for automatic recognition system to improve the identification efficiency of the contaminated or occluded license plate. this paper mainly focuses on the recognition of occlusion number plate. License plates can be divided into four categories: normal number plate, partial occlusion number plate, complete occlusion number plate and unsuspended number plate. the traditional OCR algorithm has a high accuracy in the recognition of Chinese characters, characters and numbers. Although the detection of normal and partial occlusion plates also shows a good recognition in the case of OCR, the recognition of complete occlusion and unsuspended license plates is still very poor. With the development of artificial intelligence, it is possible to identify all the sheltered and unsuspended plates better. Combining with the advantages of traditional algorithms, this paper uses traditional OCR and current deep learning algorithm to optimize the recognition effect of stained license plate.

关键词： Intelligent transportation defacement occlusion deep learning OCR

来源：评论

学校读者我要写书评

暂无评论

Exploring Homogeneity and Covariance Matrix Structure of Multistatic/Polarimetric Sea-Clutter data 10

Exploring Homogeneity and Covariance Matrix Structure of Mul...

引用

10th IEEE international workshop on Metrology for AeroSpace, MetroAeroSpace 2023

作者： Carotenuto, V. Aubry, A. De Maio, A. Fioranelli, F. University of Naples Federico II DIETI via Claudio 21 Naples Italy MS3 Group Department of Microelectronics TU Delft Mekelweg 4 Delft2628CD Netherlands

ISBN: (纸本)9781665456906

the design of bespoke adaptive detection schemes relying on the joint use of multistatic/polarimetric measurements requires a preliminary statistical inference on the clutter interference environment. this is fundamental to develop an analytic model for the received signal samples, which is used to synthesize the radar detector. In this respect, the aim of this paper is the design of suitable learning tools to study some important statistical properties of the sea-clutter environment perceived at the nodes of a multistatic/polarimetric radar system. the study is complemented by the use of radar returns measured with the Netted RADar (NetRAD), which collects simultaneously monostatic and bistatic measurements. Precisely, the homogeneity properties of the data in the slow-time domain are first assessed resorting to Generalized Inner Product (GIP) based statistics. then, the possible presence of structures in the clutter covariance matrices (both inter and intra channels) is investigated through ad-hoc statistical tools. the results show that the data, regardless the polarimetric/geometric configuration, can be modeled as drawn from a stationary process within the coherence time. Moreover, for both the monostatic and the bistatic returns the structure of the covariance matrix depends upon the polarimetric/geometric configuration of the sensing system. © 2023 IEEE.

关键词： Radar measurement

来源：评论

学校读者我要写书评

暂无评论

Mixed shared-distributed hash tables approaches for parallel state space construction

Mixed shared-distributed hash tables approaches for parallel...

引用

2011 10th international Symposium on Parallel and Distributed Computing, ISPDC 2011

作者： Saad, Rodrigo T. Zilio, Silvano Dal Berthomieu, Bernard CNRS LAAS 7 ave. Colonel Roche F-31077 Toulouse France Université de Toulouse ISAE LAAS F-31077 Toulouse France

ISBN: (纸本)9780769545400

We propose an algorithm for parallel state space construction based on an original concurrent data structure, called a localization table, that aims at better spatial and temporal balance. Our proposal is close in spirit to algorithms based on distributed hash tables, with the distinction that states are dynamically assigned to processors, i.e. we do not rely on an a-priori static partition of the state space. In our solution, every process keeps a share of the global state space. data distribution and coordination between processes is made through the localization table, that is a lockless, thread-safe data structure that approximates the set of states being processed. the localization table is used to dynamically assign newly discovered states and can be queried to return the identity of the processor that own a given state. With this approach, we are able to consolidate a network of local hash tables into an (abstract) distributed one without sacrificing memory affinity - data that are "logically connected" and physically close to each others - and without incurring performance costs associated to the use of locks to ensure data consistency. We evaluate the performance of our algorithm on different benchmarks and compare these results with other solutions proposed in the literature and with existing verification tools. © 2011 IEEE.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

algorithms and Models for the Web Graph 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Anthony Bonato Paweł Prałat Michael Mitzenmacher

ISBN: (数字)9783319035369

ISBN: (纸本)9783319035352

this book constitutes the refereed proceedings of the 10th international workshop on algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. the 17 papers presented were carefully reviewed and selected for inclusion in this volume. they address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science data Mining and Knowledge Discovery Information Storage and Retrieval

来源：评论

学校读者我要写书评

暂无评论

引用

10th international Conference on Concept Lattices and their Applications, CLA 2013

作者： Baixeries, Jaume Kaytoue, Mehdi Napoli, Amedeo Universitat Politècnica de Catalunya Barcelona Catalonia08032 Spain Université de Lyon CNRS INSA-Lyon LIRIS. UMR5205 F-69621 France LORIA CNRS Inria Nancy Grand Est - Université de Lorraine Vandœuvre-lès-NancyF-54506 France

Functional dependencies provide valuable knowledge on the relations between the attributes of a data table. To extend their use, generalizations have been proposed, among which purity and approximate dependencies. After discussing those generalizations, we provide an alternative definition, the similarity dependencies, to handle a similarity relation between data-values, hence un-crisping the basic definition of functional dependencies. this work is rooted in formal concept analysis, and we show that similarity dependencies can be easily characterized and computed with pattern structures. © paper author(s), 2013.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

10th international workshop on Combinatorial Image Analysis, IWCIA 2004

引用

10th international workshop on Combinatorial Image Analysis, IWCIA 2004

ISBN: (纸本)9783540239420

the proceedings contain 58 papers. the special focus in this conference is on Combinatorial Image Analysis. the topics include: Binary matrices under the microscope;on the reconstruction of crystals through discrete tomography;binary tomography by iterating linear programs from noisy projections;hexagonal pattern languages;a combinatorial transparent surface modeling from polarization images;integral trees: subtree depth and diameter;supercover of non-square and non-cubic grids;calculating distance with neighborhood sequences in the hexagonal grid;z-tilings of polyominoes and standard basis;curve tracking by hypothesis propagation and voting-based verification;3D topological thinning by identifying non-simple voxels;convex hulls in a 3-dimensional space;on recognizable infinite array languages;on the number of digitizations of a disc depending on its position;on the language of standard discrete planes and surfaces;characterization of bijective discretized rotations;magnification in digital topology;simple points and generic axiomatized digital surface-structures;jordan surfaces in discrete antimatroid topologies;algorithms in digital geometry based on cellular topology;an efficient euclidean distance transform;two-dimensional discrete morphing;a comparison of property estimators in stereology and digital geometry;thinning by curvature flow;convex functions on discrete sets;discrete surface segmentation into discrete planes;corner detection and curve partitioning using arc-chord distance;shape preserving sampling and reconstruction of grayscale images;junction and corner detection through the extraction and analysis of line segments tree species recognition with fuzzy texture parameters and joint non-rigid motion estimation and segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Consecutive Occurrences with Distance Constraints 10th

Consecutive Occurrences with Distance Constraints

引用

10th international Conference on algorithms and Discrete Applied Mathematics (CALDAM)

作者： Akram, Waseem Saxena, Sanjeev Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 India

A consecutive occurrence of a pattern P[1 : m] in a text T[1 : n] is a pair (i, j), with i 0 and a pattern P, report the k closest consecutive occurrences of P in T". Using the same data structure mentioned abov... 详细信息

ISBN: (纸本)9783031522123;9783031522130

A consecutive occurrence of a pattern P[1 : m] in a text T[1 : n] is a pair (i, j), with i < j, of indices in T such that P occurs at i and j, but not at any index between them. We give deterministic solutions to the following two problems using simple and classical data structures. the first problem is to preprocess the text T so that one can efficiently answer bounded gap queries: "given a pattern P and a range [alpha, beta] such that 1 <= alpha <= beta <= n, report all the consecutive occurrences (i, j) of the pattern P in the text T with distance j - i is an element of[alpha, beta]". We present an O(n log n)-space data structure that supports bounded gap queries in O(m+log alpha+#output)-time. the time needed to build the data structure is O(n(2)). Moreover, the query time can be improved to O(m+#output) if alpha or beta is known at the time of preprocessing. the second problem is the string indexing for top-k close consecutive occurrences problem, which asks to preprocess the input text T[1 : n] so that one can quickly answer top-k queries: "given an integer k > 0 and a pattern P, report the k closest consecutive occurrences of P in T". Using the same data structure mentioned above, we can answer a top- k query in O(m+#output)-time.

关键词： Pattern Matching Segment Intersection data structures algorithms

来源：评论

学校读者我要写书评

暂无评论

Proving tree algorithms for succinct data structures 10

Proving tree algorithms for succinct data structures

引用

10th international Conference on Interactive theorem Proving, ITP 2019

作者： Affeldt, Reynald Garrigue, Jacques Qi, Xuanrui Tanaka, Kazunari National Institute of Advanced Industrial Science and Technology Tsukuba Japan Graduate School of Mathematics Nagoya University Japan Department of Computer Science Tufts University MedfordMA United States

ISBN: (纸本)9783959771221

Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. they rely on cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect of two different tree-based succinct representations and their accompanying algorithms. One is the Level-Order Unary Degree Sequence, which encodes the structure of a tree in breadth-first order as a sequence of bits, where access operations can be defined in terms of Rank and Select, which work in constant time for static bit sequences. the other represents dynamic bit sequences as binary balanced trees, where Rank and Select present a low logarithmic overhead compared to their static versions, and with efficient insertion and deletion. the two can be stacked to provide a dynamic representation of dictionaries for instance. While both representations are well-known, we believe this to be their first formalization and a needed step towards provably-safe implementations of big data. © Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, and Kazunari Tanaka.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

General Preference Structure with Uncertainty data Present by Interval-Valued Fuzzy Relation and Used in Decision Making Model 4th

引用

10th Conference of the European-Society-for-Fuzzy-Logic-and-Technology (EUSFLAT) / 16th international workshop on Intuitionistic Fuzzy Sets and Generalized Nets (IWIFSGN)

作者： Pekala, Barbara Univ Rzeszow Fac Math & Nat Sci Interdisciplinary Ctr Computat Modelling Pigonia 1A PL-35310 Rzeszow Poland

ISBN: (纸本)9783319668277;9783319668260

Interval-valued fuzzy relations can be interpreted as a tool that may help to model in a better way imperfect information, especially under imperfectly defined facts and imprecise knowledge. Preference structures are of great interest nowadays because of their applications. From a weak preference relation derive the following relations: strict preference, indifference and incomparability, which by aggregations and negations are created and examined in this paper. Moreover, we propose the algorithm of decision making by using new preference structure.

关键词： Interval-valued fuzzy relations Preference relations Reciprocity property

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共50页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：