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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

71 篇 会议
7 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

52 篇 工学
- 42 篇 计算机科学与技术...
- 26 篇 软件工程
- 10 篇 信息与通信工程
- 9 篇 电气工程
- 5 篇 仪器科学与技术
- 2 篇 机械工程
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 土木工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
24 篇 理学
- 20 篇 数学
- 2 篇 生物学
- 1 篇 地质学
- 1 篇 统计学（可授理学、...
6 篇 管理学
- 4 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 法学
- 1 篇 社会学

主题

29 篇 data structures
9 篇 data mining
5 篇 algorithm design...
4 篇 data mining and ...
4 篇 discrete mathema...
4 篇 feature extracti...
4 篇 clustering algor...
4 篇 prediction algor...
4 篇 artificial intel...
4 篇 algorithm analys...
3 篇 algorithms
3 篇 databases
3 篇 bioinformatics
3 篇 classification a...
3 篇 computational bi...
3 篇 data models
2 篇 parallel algorit...
2 篇 vm placement
2 篇 dictionary
2 篇 approximation al...

机构

4 篇 polytech univ de...
3 篇 california state...
2 篇 university of gr...
2 篇 mcgill univ mont...
2 篇 polytechnic univ...
2 篇 free univ brusse...
1 篇 university of ca...
1 篇 yahoo labs barce...
1 篇 sidney kimmel co...
1 篇 univ desarrollo ...
1 篇 department of co...
1 篇 faculty of infor...
1 篇 univ thessaly vo...
1 篇 sch comp sci & i...
1 篇 department of po...
1 篇 univ melbourne d...
1 篇 wilhelm-schickar...
1 篇 department of co...
1 篇 department of si...
1 篇 school of civil ...

作者

4 篇 iacono j
3 篇 tóth csaba d.
2 篇 ignacio rojas
2 篇 langerman s
2 篇 gonzalo joya
2 篇 gawrychowski paw...
2 篇 andreu catala
1 篇 khokhar ashfaq
1 篇 yu zheng
1 篇 vishwa s. parekh
1 篇 dusadee apichart...
1 篇 sacomoto gustavo
1 篇 salikhov kamil
1 篇 elena baralis
1 篇 luca cagliero
1 篇 gharbaoui molka
1 篇 michael a. jacob...
1 篇 qian weng
1 篇 hong edwin s.
1 篇 petri matthias

语言

83 篇 英文
1 篇 中文

检索条件"任意字段=13th International Symposium on Algorithms and Data Structures, WADS 2013"

共 84 条记录，以下是71-80 订阅

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

详细简洁

排序：

13th international symposium on algorithms and Computation, ISAAC 2002

引用

13th Annual international symposium on algorithms and Computation, ISAAC 2002

ISBN: (纸本)3540001425

the proceedings contain 57 papers. the special focus in this conference is on algorithms and Computation. the topics include: Biased skip lists;space-efficient data structures for flexible text retrieval systems;key independent optimality;on the comparison-addition complexity of all-pairs shortest paths;on the clique-width of graphs in hereditary classes;the probability of a rendezvous is minimal in complete graphs;on the minimum volume of a perturbed unit cube;non-delaunay-based curve reconstruction;cutting a country for smallest square fit;on the emptiness problem for two-way NFA with one reversal-bounded counter;quantum multi-prover interactive proof systems with limited prior entanglement;some remarks on the L-conjecture;a framework for network reliability problems on graphs of bounded treewidth;a faster approximation algorithm for 2-edge-connectivity augmentation;tree spanners on chordal graphs;an asymptotic fully polynomial time approximation scheme for bin covering;improved approximation algorithms for max-2sat with cardinality constraint;a better approximation for the two-stage assembly scheduling problem with two machines at the first stage;queaps;funnel heap - a cache oblivious priority queue;characterizing history independent data structures;faster fixed parameter tractable algorithms for undirected feedback vertex set;casting a polyhedron with directional uncertainty;hierarchy of surface models and irreducible triangulation;algorithms and complexity for tetrahedralization detections;average-case communication-optimal parallel parenthesis matching;optimal f-reliable protocols for the do-all problem on single-hop wireless networks (extended abstract);new results for energy-efficient broadcasting in wireless networks;an improved algorithm for the minimum manhattan network problem;approximate distance oracles revisited and flat-state connectivity of linkages under dihedral motions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Characterizing history independent data structures

引用

13th Annual international symposium on algorithms and Computation, ISAAC 2002

作者： Hartline, Jason D. Hong, Edwin S. Mohr, Alexander E. Pentney, William R. Rocke, Emily C. Department of Computer Science University of Washington SeattleWA98195 United States

ISBN: (纸本)3540001425

We consider history independent data structures as proposed for study by Teague and Naor [3]. In a history independent data structure, nothing can be learned from the representation of the data structure except for what is available from the abstract data structure. We show that for the most part, strong history independent data structures have canonical representations. We also provide a natural less restrictive definition of strong history independence and characterize how it restricts allowable representations. We also give a general formula for creating dynamically resizing history independent data structures and give a related impossibility result. © Springer-Verlag Berlin Heidelberg 2002.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Adaptive multiuser receivers for DS-CDMA using minimum BER gradient-Newton algorithms

Adaptive multiuser receivers for DS-CDMA using minimum BER g...

引用

IEEE international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： R.C. de Lamare R. Sampaio-Neto CETUC PUC-RIO Rio de Janeiro Brazil

We investigate the use of adaptive minimum bit error rate (MBER) gradient-Newton algorithms in the design of linear multiuser receivers (MUD) for DS-CDMA systems. the proposed algorithms approximate the bit error rate (BER) from training data using linear multiuser detection structures. We carry out a comparative analysis of linear MUDs employing minimum mean squared error (MMSE), previously reported MBER and the proposed MBER algorithms. Computer simulation experiments show that the MBER gradient-Newton approaches outperform other analysed algorithms and can operate with shorter training sequences.

关键词： Multiaccess communication Bit error rate Multiple access interference Matched filters Detectors Cost function Multiuser detection Mean square error methods Convergence Training data

来源：评论

学校读者我要写书评

暂无评论

Mathematical models and optimal algorithms of dynamic data structure control 13th

Mathematical models and optimal algorithms of dynamic data s...

引用

13th international symposium on Fundamentals of Computation theory, FCT 2001

作者： Sokolov, Andrew V. Karelian Research Center of the Russian Academy of Sciences Institute of Applied Mathematical Research IAMR KRC RAS 11 Pushkinskaya St Petrozavodsk Karelia185610 Russia

ISBN: (纸本)9783540446699

this paper concerns issues related to building mathematical models and optimal algorithms of stacks and queues [1] control in singleand two-level memory. these models were constructed as 1, 2 and 3- dimensional random walks. In our opinion the algorithms, constructed for concrete data structure, will work better, than universal replacement algorithms in paging virtual and cash-memory. It was confirmed by the practice of construction of stack computers. © Springer-Verlag Berlin Heidelberg 2001.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Polynomial time algorithms for finding unordered tree patterns with internal variables 13th

Polynomial time algorithms for finding unordered tree patter...

引用

13th international symposium on Fundamentals of Computation theory, FCT 2001

作者： Shoudai, Takayoshi Uchida, Tomoyuki Miyahara, Tetsuhiro Department of Informatics Kyushu University Kasuga816-8580 Japan Faculty of Information Sciences Hiroshima City University Hiroshima731-3194 Japan

ISBN: (纸本)9783540446699

Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to extract meaningful and hidden knowledge from such tree structured documents, we consider a minimal language (MINL) problem for term trees. the MINL problem for term trees is to find a term tree t such that the language generated by t is minimal among languages, generated by term trees, which contain all given tree structured data. Firstly, we show that the MINL problem for regular term trees is computable in polynomial time if the number of edge labels is infinite. Next, we show that the MINL problems with optimizing the size of an output term tree are NP-complete. Finally, in order to show that our polynomial time algorithm for the MINL problem can be applied to data mining from real-world Web documents, we show that regular term tree languages are polynomial time inductively inferable from positive data if the number of edge labels is infinite. © Springer-Verlag Berlin Heidelberg 2001.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

11th IPPS/SPDP 1999 Workshops Held in Conjunction with the 13th international Parallel Processing symposium and 10th symposium on Parallel and Distributed Processing, 1999

引用

13th international Parallel Processing symposium, IPPS 1999 Held in Conjunction with the 10th symposium on Parallel and Distributed Processing, SPDP 1999

ISBN: (纸本)3540658319

the proceedings contain 137 papers. the special focus in this conference is on High-Level Parallel Programming Models and Supportive Environments. the topics include: Efficient program partitioning based communication;a flexible base for transparent shared memory programming models on clusters of PCs;flexible collective operations for distributed object groups;a framework for performance evaluation of scalable computing;recursive individually distributed objects;a flexible combination of on-stack execution and work-stealing;an automatic distribution front-end for java;concurrent language support for interoperable applications;on the distributed implementation of aggregate data structures by program transformation;a transformational framework for skeletal programs;implementing a non-strict functional programming language on a threaded architecture;the biological basis of the immune system as a model for intelligent agents;a formal definition of the phenomenon of collective intelligence and its IQ measure;implementation of data flow logical operations via self-assembly of DNA;a parallel hybrid evolutionary metaheuristic for the period vehicle routing problem;distributed scheduling with decomposed optimization criterion;a parallel genetic algorithm for task mapping on parallel machines;evolution-based scheduling of fault-tolerant programs on multiple processors;a genetic-based fault-tolerant routing strategy for multiprocessor networks;regularity considerations in instance-based locality optimization;parallel ant colonies for combinatorial optimization problems;an analysis of synchronous and asynchronous parallel distributed genetic algorithms with structured and panmictic islands and GA-based parallel image registration on parallel clusters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

P-EDR: An algorithm for parallel implementation of Parzen density estimation from uncertain observations

P-EDR: An algorithm for parallel implementation of Parzen de...

引用

international symposium on Parallel Processing

作者： P.E. Lopez de Teruel J.M. Garcia M. Acacio O. Canovas Departamento de Ingeniería y Tecnología de Computadores Facultad de Informática University of Murcia Murcia Spain

We have developed a parallel version of a new algorithm for nonparametric density estimation when the input samples are not directly known, or they have some noise. the algorithm is an extension of the Parzen method for exact observations, but management of uncertainty implies heavy computational loads in terms of both calculus and storage. therefore, a parallel version of the algorithm is more adequate to solve this extended problem in a practical time, specially for samples of medium-large sizes. Our parallel algorithm has been designed in an SPMD style and implemented in a message-passing parallel environment. An efficient treatment of the distribution of the main data structure among processors, together with a low communication cost scheme results in a high scalability of the algorithm. Preliminary performance evaluations in a cluster of workstations show excellent speed-up results.

关键词： Uncertainty Calculus Parallel algorithms Algorithm design and analysis data structures Costs Scalability Clustering algorithms Workstations

来源：评论

学校读者我要写书评

暂无评论

algorithms in Bioinformatics 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Aaron Darling Jens Stoye

ISBN: (数字)9783642404535

ISBN: (纸本)9783642404528

this book constitutes the refereed proceedings of the 13th international Workshop on algorithms in Bioinformatics, WABI 2013, held in Sophia Antipolis, France, in September 2013. WABI 2013 is one of seven workshops which, along with the European symposium on algorithms (ESA), constitute the ALGO annual meeting and highlights research in algorithmic work for bioinformatics, computational biology and systems biology. the goal is to present recent research results, including significant work-in-progress, and to identify and explore directions of future research. the 27 full papers presented were carefully reviewed and selected from 61 submissions. the papers cover all aspects of algorithms in bioinformatics, computational biology and systems biology.

关键词： Computational Biology/Bioinformatics Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices data Mining and Knowledge Discovery Probability and Statistics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

Advances in Computational Intelligence 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Ignacio Rojas Gonzalo Joya Andreu Catala

ISBN: (数字)9783319192581

ISBN: (纸本)9783319192574

this two-volume set LNCS 9094 and LNCS 9095 constitutes the thoroughly refereed proceedings of the 13th international Work-Conference on Artificial Neural Networks, IWANN 2015, held in Palma de Mallorca, Spain, in June 2013. the 99 revised full papers presented together with 1 invited talk were carefully reviewed and selected from 195 submissions. the papers are organized in topical sections on brain-computer interfaces: applications and tele-services; multi-robot systems: applications and theory (MRSAT); video and image processing; transfer learning; structures, algorithms and methods in artificial intelligence; interactive and cognitive environments; mathematical and theoretical methods in fuzzy systems; pattern recognition; embedded intelligent systems; expert systems; advances in computational intelligence; and applications of computational intelligence.

关键词： Computational Biology/Bioinformatics Pattern Recognition Artificial Intelligence data Mining and Knowledge Discovery Models and Principles Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Advances in Spatial and Temporal databases 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Mario A. Nascimento Timos Sellis Reynold Cheng Jörg Sander Yu Zheng Hans-Peter Kriegel Matthias Renz Christian Sengstock

ISBN: (数字)9783642402357

ISBN: (纸本)9783642402340

this book constitutes the refereed proceedings of the 13th international symposium on Spatial and Temporal databases, SSTD 2013, held in Munich, Germany, in August 2013. the 24 revised full papers presented were carefully reviewed and selected from 58 submissions. the papers are organized in topical sections on joins and algorithms; mining and discovery; indexing; trajectories and road network data; nearest neighbours queries; uncertainty; and demonstrations.

关键词： database Management Artificial Intelligence Discrete Mathematics in Computer Science data Mining and Knowledge Discovery

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：