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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

137 篇 期刊文献
27 篇 会议
6 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

140 篇 工学
- 126 篇 计算机科学与技术...
- 51 篇 电气工程
- 19 篇 软件工程
- 10 篇 信息与通信工程
- 6 篇 仪器科学与技术
- 6 篇 控制科学与工程
- 3 篇 电子科学与技术（可...
- 2 篇 石油与天然气工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 交通运输工程
61 篇 理学
- 55 篇 数学
- 11 篇 统计学（可授理学、...
- 6 篇 生物学
- 3 篇 化学
- 1 篇 物理学
7 篇 管理学
- 7 篇 管理科学与工程(可...
2 篇 经济学
- 2 篇 应用经济学
1 篇 医学
- 1 篇 临床医学

主题

171 篇 probabilistic al...
9 篇 machine learning
6 篇 parallel algorit...
5 篇 approximation al...
5 篇 tracking
5 篇 finite fields
4 篇 reliability
4 篇 clustering
4 篇 algorithms
4 篇 analysis of algo...
4 篇 distributed algo...
4 篇 biology and gene...
3 篇 computational co...
3 篇 random graphs
3 篇 geometric soluti...
3 篇 polynomial
3 篇 markov processes
3 篇 computational ge...
3 篇 primality
3 篇 decision trees

机构

3 篇 technion israel ...
3 篇 univ buenos aire...
2 篇 agena ltd cambri...
2 篇 univ nacl gen sa...
2 篇 univ cambridge d...
2 篇 cornell univ dep...
2 篇 vrije univ amste...
2 篇 google inc mount...
2 篇 northwestern uni...
2 篇 queen mary univ ...
2 篇 brno university ...
2 篇 idiap res inst c...
2 篇 inst tecnol buen...
2 篇 core secur techn...
1 篇 universidad vera...
1 篇 the work of the ...
1 篇 crytek r&d dept ...
1 篇 univ malaga dept...
1 篇 univ pisa dipart...
1 篇 fgan fom ettling...

作者

4 篇 alt helmut
4 篇 scharf ludmila
3 篇 matera guillermo
2 篇 garcia j. c.
2 篇 srinivasan a
2 篇 ezome tony
2 篇 pizarro d.
2 篇 kaski samuel
2 篇 pang jun
2 篇 juan angel a.
2 篇 naor m
2 篇 moran s
2 篇 ciuffoletti a
2 篇 devismes stephan...
2 篇 waissbein ariel
2 篇 solerno pablo
2 篇 schymura daria
2 篇 lercier reynald
2 篇 neil martin
2 篇 noguchi takao

语言

166 篇 英文
5 篇 其他

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

共 171 条记录，以下是141-150 订阅

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

详细简洁

排序：

Nearly Optimal List Labeling 65

Nearly Optimal List Labeling

引用

65th Symposium on Foundations of Computer Science

作者： Bender, Michael A. Conway, Alex Farach-Colton, Martin Komlos, Hanna Koucky, Michal Kuszmaul, William Saks, Michael SUNY Stony Brook Stony Brook NY 11794 USA RelationalAI Stony Brook NY 11790 USA Cornell Tech New York NY USA NYU New York NY USA Charles Univ Prague Prague Czech Republic Carnegie Mellon Univ Pittsburgh PA USA Rutgers State Univ Piscataway NJ USA

ISBN: (纸本)9798331516758;9798331516741

The list-labeling problem captures the basic task of storing a dynamically changing set of up to n elements in sorted order in an array of size m = (1+ Theta(1))n. The goal is to support insertions and deletions while moving around elements within the array as little as possible. Until recently, the best known upper bound stood at O(log(2) n) amortized cost. This bound, which was first established in 1981, was finally improved two years ago, when a randomized O(log(3/2) n) expected-cost algorithm was discovered. The best randomized lower bound for this problem remains O(log n), and closing this gap is considered to be a major open problem in data structures. In this paper, we present the See-Saw Algorithm, a randomized list-labeling solution that achieves a nearly optimal bound of O(log n polyloglog n) amortized expected cost. This bound is achieved despite at least three lower bounds showing that this type of result is impossible for large classes of solutions.

关键词： Data structures probabilistic algorithms combinatorial algorithms

来源：评论

学校读者我要写书评

暂无评论

Ultrametric Vs. Quantum Query algorithms 3

Ultrametric Vs. Quantum Query Algorithms

引用

3rd International Conference on the Theory and Practice of Natural Computing (TPNC)

作者： Freivalds, Rusins Latvian State Univ Inst Math & Comp Sci LV-1459 Riga Latvia

ISBN: (纸本)9783319137490;9783319137483

Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.

关键词： Nature-inspired models of computation ultrametric algorithms probabilistic algorithms quantum algorithms

来源：评论

学校读者我要写书评

暂无评论

Stochastic Processes and Markov Chains in Shape and Material Optimization Problems of Composite Structures 7

Stochastic Processes and Markov Chains in Shape and Material...

引用

7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)

作者： Muc, Aleksander Wygoda, Mateusz Cracow Univ Technol Inst Machine Design Krakow Poland

ISBN: (纸本)9781509054541

Commonly shape and material optimization for complex structures having complicated boundary and loading conditions requires FE analysis in order to determine accurately enough (especially for composite structures) objective functions. The solutions of such class of problems become difficult as we use probabilistic algorithms. Therefore, a general method using the Markov chain and stochastic equations is proposed to reduce the total number of iterations (computations) that are necessary to obtain a global optimum (or a quasi-global). The proposed method can be applied both for isotropic and anisotropic (composite laminates) structures. The method is illustrated by a numerical example.

关键词： probabilistic algorithms Markov Chain Stochastic Equations

来源：评论

学校读者我要写书评

暂无评论

CED²: Communication Efficient Disjointness Decision

CED<SUP>2</SUP>: Communication Efficient Disjointness Decisi...

引用

6th International Conference on Security and Privacy in Communication Networks (SecureComm 2010)

作者： Marconi, Luciana Conti, Mauro Di Pietro, Roberto Univ Roma La Sapienza Dept Comp Sci I-00198 Rome Italy Vrije Univ Amsterdam Dept Comp Sci NL-1081 HV Amsterdam Netherlands Univ Rome Tre Dept Math I-00146 Rome Italy

ISBN: (纸本)9783642161605

Enforcing security often requires the two legitimate parties of a communication to determine whether they share a secret, without disclosing information (e.g. the shared secret itself, or just the existence of such a secret) to third parties-or even to the other party, if it is not the legitimate party but an adversary pretending to impersonate the legitimate one. In this paper, we propose CED2 (Communication Efficient Disjointness Decision), a probabilistic and distributed protocol that allows two parties-each one having a finite set of elements-to decide about the disjointness of their sets. CED2 is particularly suitable for devices having constraints on energy, communication, storage, and bandwidth. Examples of these devices are satellite phones, or nodes of wireless sensor networks. We show that CED2 significantly improves the communication cost compared to the state of the art, while providing the same degree of privacy and security. Analysis and simulations support the findings.

关键词： sets disjointness test communication complexity privacy security probabilistic algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Asynchronous Bounded Expected Delay Networks

Brief Announcement: Asynchronous Bounded Expected Delay Netw...

引用

29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

作者： Bakhshi, Rena Endrullis, Jorg Fokkink, Wan Pang, Jun Vrije Univ Amsterdam Dept Comp Sci NL-1081 HV Amsterdam Netherlands

ISBN: (纸本)9781605588889

We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is often too strict for real-life applications. To this end we introduce a novel probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all asynchronous executions are possible, but executions with extremely long delays are less probable. The ABE model captures asynchrony that occurs in sensor networks and ad-hoc networks.

关键词： ABD networks probabilistic algorithms anonymous networks

来源：评论

学校读者我要写书评

暂无评论

An Application of Data Compression Models to Handwritten Digit Classification 19th

An Application of Data Compression Models to Handwritten Dig...

引用

19th International Conference on Advanced Concepts for Intelligent Vision Systems (ACIVS)

作者： Pinho, Armando J. Pratas, Diogo Univ Aveiro IEETA DETI Aveiro Portugal

ISBN: (纸本)9783030014490;9783030014483

In this paper, we address handwritten digit classification as a special problem of data compression modeling. The creation of the models usually known as training is just a process of counting. Moreover, the model associated to each class can be trained independently of all the other class models. Also, they can be updated later with new examples, even if the old ones are not available anymore. Under this framework, we show that it is possible to attain a classification accuracy consistently above 99.3% on the MNIST dataset, using classifiers trained in less than one hour on a common laptop.

关键词： Compression-based classification Handwritten digits Kolmogorov complexity Finite-context models probabilistic algorithms Algorithmic information theory

来源：评论

学校读者我要写书评

暂无评论

The Effectiveness of Optimization algorithms in Shape and Topology Discrete Optimisation of 2-D Composite Structures 7

The Effectiveness of Optimization Algorithms in Shape and To...

引用

7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)

作者： Muc, A. Sanetra, I. Cracow Univ Technol Inst Mech & Machine Design Krakow Poland

ISBN: (纸本)9781509054541

The aim of the paper is to discuss the formulation and solution of optimisation problems for composite structures. A special attention is focused on the coding problems of design variables. The appropriate discrete coding allows us to use the same optimisation algorithms for different class of problems, i.e. shape and topology optimisation using both deterministic and fuzzy approaches.

关键词： probabilistic algorithms Plates Shells Composites Fuzzy Optimisation

来源：评论

学校读者我要写书评

暂无评论

Comparing a Kalman Filter and a particle filter in a multiple objects tracking application

Comparing a Kalman Filter and a particle filter in a multipl...

引用

IEEE International Symposium on Intelligent Signal Processing

作者： Marron, M. Garcia, J. C. Sotelo, M. A. Cabello, M. Pizarro, D. Huerta, F. Cerro, J. Univ Alcala de Henares Dept Elect Alcala De Henares Spain

ISBN: (纸本)9781424408290

Two of the most important solutions in position estimation are compared, in this paper, in order to test their efficiency in a multi-tracking application in an unstructured and complex environment. A Particle Filter is extended and adapted with a clustering process in order to track a variable number of objects. The other approach is to use a Kalman Filter with an association algorithm for each of the objects to track. Both algorithms are described in the paper and the results obtained with their real-time execution in the mentioned application are shown. Finally interesting conclusions extracted from this comparison are remarked at the end.

关键词： position estimation probabilistic algorithms robotics tracking

来源：评论

学校读者我要写书评

暂无评论

Neighbour Aware Random Sampling (NARS) algorithm for load balancing in Cloud computing 1

Neighbour Aware Random Sampling (NARS) algorithm for load ba...

引用

IEEE International Conference on Electrical, Computer and Communication Technologies

作者： Ariharan, V Manakattu, Sheeja S. Bharat Elect Ltd Cent Res Lab Bengaluru India

ISBN: (纸本)9781479960859

Load balancing plays a vital role in Cloud computing to enhance throughput, optimize resource use and reduce response time. The main features to be considered while selecting a load balancing algorithm for cloud is the ability of the algorithm to address distributed network, dynamic environment and self-regulation. Biased random sampling is one such algorithm;it allocates jobs by performing a random walk in the network. The selection of neighbour is uniformly distributed among the neighbour nodes in case of biased random sampling algorithm. Improved version of random sampling algorithm uses cost based load computation to select node for random walk [1]. This paper introduces neighbour awareness and prediction mechanisms to further improve the selection process of nodes for random walk. The proposed algorithm selects the least loaded node from the neighbour list for the random walk. This can be achieved by computing probability of each neighbour based on perceived load of the respective neighbour. Thus the probability of choosing lightly loaded node can be increased and hence the job waiting time can be decreased further.

关键词： Cloud computing load balancing random sampling neighbour awareness probabilistic algorithms

来源：评论

学校读者我要写书评

暂无评论

A probabilistic Algorithm for Secret Matrix Share Size Reduction

A Probabilistic Algorithm for Secret Matrix Share Size Reduc...

引用

European Wireless 2013;19th European Wireless Conference

作者： Eckhard Pfluegel Emmanouil Panaousis Christos Politis Wireless Multimedia & Networking (WMN) Research Group Kingston University London Queen Mary University of London

Secret sharing is an important tool in cryptography and has many applications for wireless networks. This paper is motivated by the need for space-efficient secret sharing schemes. We first propose a simple probabilistic algorithm which can be used, prior to secret sharing, in order to split a given secret into public and private data. The public data can be made openly available, and any specific secret sharing method can be used in order to share the private data. We then show that, combined with a previously published space-efficient single secret sharing method, this yields a novel probabilistic matrix-based online multi-secret sharing method with small expected share size. In particular, compared with other matrix-based approaches, our scheme is of similar expected computational cost but smaller share size. Finally, we report on an implementation of our method and evaluate its performance. Our algorithm could be useful to design efficient secret sharing applications for wireless networks, in particular mobile ad-hoc networks, in areas such as secure routing, data transmission or key management.

关键词： Space-Efficient Multi-Secret Sharing probabilistic algorithms secret sharing private data Wireless networks A* Algorithm Probability Key management algorithms cryptography data transmission Size reduction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：