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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

476 篇 期刊文献
145 篇 会议
5 篇 学位论文
2 册 图书

馆藏范围

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

日期分布

学科分类号

456 篇 工学
- 361 篇 计算机科学与技术...
- 116 篇 电气工程
- 77 篇 软件工程
- 42 篇 控制科学与工程
- 40 篇 信息与通信工程
- 8 篇 机械工程
- 7 篇 电子科学与技术（可...
- 4 篇 力学（可授工学、理...
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 石油与天然气工程
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 3 篇 网络空间安全
- 2 篇 测绘科学与技术
- 2 篇 化学工程与技术
- 2 篇 航空宇航科学与技...
304 篇 理学
- 273 篇 数学
- 29 篇 物理学
- 23 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 生物学
- 1 篇 化学
60 篇 管理学
- 59 篇 管理科学与工程(可...
- 12 篇 工商管理
17 篇 经济学
- 15 篇 应用经济学
- 2 篇 理论经济学
6 篇 医学
- 5 篇 临床医学
3 篇 农学
1 篇 文学
- 1 篇 新闻传播学
1 篇 军事学

主题

628 篇 randomized algor...
31 篇 approximation al...
25 篇 distributed algo...
18 篇 low-rank approxi...
17 篇 computational ge...
15 篇 approximation
14 篇 lower bound
13 篇 clustering
12 篇 optimization
11 篇 dimension reduct...
11 篇 parallel algorit...
10 篇 load balancing
10 篇 linear programmi...
10 篇 combinatorial op...
9 篇 competitive anal...
9 篇 singular value d...
9 篇 sketching
8 篇 computational co...
8 篇 big data
8 篇 leader election

机构

11 篇 chongqing univ c...
6 篇 fudan univ sch m...
6 篇 stanford univ de...
5 篇 univ hong kong d...
5 篇 univ colorado de...
5 篇 city univ hong k...
5 篇 natl univ singap...
4 篇 n carolina state...
4 篇 wuhan univ sch m...
4 篇 max planck inst ...
4 篇 tsinghua univ in...
4 篇 stanford univ ic...
4 篇 fudan univ key l...
4 篇 purdue univ dept...
4 篇 univ michigan de...
3 篇 univ elect sci &...
3 篇 univ chicago dep...
3 篇 iit dept comp sc...
3 篇 xiamen univ wang...
3 篇 chongqing univ k...

作者

11 篇 li hanyu
9 篇 pandurangan gopa...
6 篇 yang haizhao
6 篇 wei yimin
5 篇 robinson peter
5 篇 tropp joel a.
5 篇 wang mengyu
5 篇 kaltofen e
5 篇 alipour sharareh
5 篇 gulwani s
5 篇 ghodsi mohammad
5 篇 wang jianxin
5 篇 molla anisur rah...
5 篇 lau francis c. m...
5 篇 necula gc
5 篇 chen jianer
4 篇 sauerwald thomas
4 篇 kumar manish
4 篇 liu yang
4 篇 mostefaoui achou...

语言

583 篇 英文
39 篇 其他
5 篇 中文
1 篇 德文

检索条件"主题词=Randomized algorithm"

共 628 条记录，以下是471-480 订阅

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

详细简洁

排序：

Global value numbering using random interpretation 04

Global value numbering using random interpretation

引用

31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

作者： Gulwani, S Necula, GC Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)9781581137293

We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are treated as uninterpreted functions. We are not aware of any complete polynomial-time deterministic algorithm for the same problem. The algorithm does not require symbolic manipulations and hence is simpler to implement than the deterministic symbolic algorithms. The price for these benefits is that there is a probability that the algorithm can report a false equality. We prove that this probability can be made arbitrarily small by controlling various parameters of the algorithm. Our algorithm is based on the idea of random interpretation, which relies on executing a program on a number of random inputs and discovering relationships from the computed values. The computations are done by giving random linear interpretations to the operators in the program. Both branches of a conditional are executed. At join points, the program states are combined using a random affine combination. We discuss ways in which this algorithm can be made more precise by using more accurate interpretations for the linear arithmetic operators and other language constructs.

关键词： global value numbering Herbrand equivalences random interpretation randomized algorithm uninterpreted functions

来源：评论

学校读者我要写书评

暂无评论

Generation of Communication Schedules for Multi-Mode Distributed Real-Time Applications

Generation of Communication Schedules for Multi-Mode Distrib...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Azim, Akramul Carvajal, Gonzalo Pellizzoni, Rodolfo Fischmeister, Sebastian Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783981537024

A key problem in designing multi-mode real-time systems is the generation of schedules to reduce the complexities of transforming the model semantics to code. Moreover, distributed multi-mode applications are prone to suffer from delays incurred during mode changes. We therefore aim to generate communication schedules that have low average mode-change delay for multi-mode real-time distributed applications. In this paper, we use optimization constraints associated to timing requirements to generate state-based schedules for multi-mode communication systems, and illustrate the workflow for generating schedules from specifications through a real-time video monitoring case-study. Our experiments in the case-study demonstrate that schedules generated using the proposed method reduce the average mode-change delay in relation to a randomized algorithm and the well-known EDF scheduling algorithm.

关键词： bandwidth allocation delays processor scheduling randomised algorithms real-time systems video communication EDF scheduling algorithm average mode-change delay communication schedule generation earliest-deadline-first mode-change delay model semantics multimode communication systems multimode distributed real-time applications optimization constraints randomized algorithm real-time video monitoring state-based schedules Bandwidth Delays Real-time systems Schedules Streaming media Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

A QoS-aware Task Allocation Model for Mobile Cloud Computing 2

A QoS-aware Task Allocation Model for Mobile Cloud Computing

引用

Second International Conference on Web Research (ICWR)

作者： Zarei, Mohammad Hossein Shirsavar, Milad Azizpour Yazdani, Nasser Univ Tehran Sch Elect & Comp Engn Router Lab Tehran Iran

ISBN: (纸本)9781509021666

Mobile Cloud Computing (MCC) tries to offload computation from mobile devices, including smartphones and tablets, to cloud providers to solve the limitations of mobile devices with the power of cloud computing. Providing cloud computing quality of service (QoS) in mobile devices is harder to achieve compared to fixed devices due to the limited computing resources, storage and energy in mobile devices. On the other hand, node mobility causes rapid changes in network topology. Tasks in cloud computing infrastructure are performed with different quality of service requirements. Using appropriate allocation of tasks to cloud computing resources, can improve QoS. In this paper, we formulate the task allocation problem as a minimum nonlinear optimization problem. A randomized algorithm is proposed in which the result is close to the optimal solution. It improves the QoS in mobile devices by choosing suitable cloud providers for a given user application. The results show that the proposed algorithm is faster and more scalable compared to optimal solution.

关键词： Mobile Cloud Computing Quality of Service Optimization Problem randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost 27

Correlation Clustering with Same-Cluster Queries Bounded by ...

引用

27th Annual European Symposium on algorithms (ESA)

作者： Saha, Barna Subramanian, Sanjay Univ Calif Berkeley Berkeley CA 94720 USA Allen Inst Artificial Intelligence Seattle WA USA

ISBN: (纸本)9783959771245

Several clustering frameworks with interactive (semi-supervised) queries have been studied in the past. Recently, clustering with same-cluster queries has become popular. An algorithm in this setting has access to an oracle with full knowledge of an optimal clustering, and the algorithm can ask the oracle queries of the form, "Does the optimal clustering put vertices u and v in the same cluster?" Due to its simplicity, this querying model can easily be implemented in real crowd-sourcing platforms and has attracted a lot of recent work. In this paper, we study the popular correlation clustering problem (Bansal et al., 2002) under the same-cluster querying framework. Given a complete graph G = (V, E) with positive and negative edge labels, correlation clustering objective aims to compute a graph clustering that minimizes the total number of disagreements, that is the negative intra-cluster edges and positive inter-cluster edges. In a recent work, Ailon et al. (2018b) provided an approximation algorithm for correlation clustering that approximates the correlation clustering objective within (1 + epsilon) with O(k(14) log n log k /epsilon(6)) queries when the number of clusters, k, is fixed. For many applications, k is not fixed and can grow with vertical bar V vertical bar. Moreover, the dependency of k(1)4 on query complexity renders the algorithm impractical even for datasets with small values of k. In this paper, we take a different approach. Let C-OPT be the number of disagreements made by the optimal clustering. We present algorithms for correlation clustering whose error and query bounds are parameterized by C-OPT rather than by the number of clusters. Indeed, a good clustering must have small C-OPT. Specifically, we present an efficient algorithm that recovers an exact optimal clustering using at most 2C(OPT) queries and an efficient algorithm that outputs a 2-approximation using at most C-OPT queries. In addition, we show under a plausible complexity assumption

关键词： Clustering Approximation algorithm Crowdsourcing randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Log-Determinant Computation via Weighted L₂ Polynomial Approximation with Prior Distribution of Eigenvalues 1

引用

3rd International Conference on High-Performance Computing and Applications (HPCA)

作者： Peng, Wei Wang, Hongxia Natl Univ Def Technol Coll Sci Sanyi Ave Changsha 410073 Hunan Peoples R China

ISBN: (数字)9783319325576

ISBN: (纸本)9783319325576;9783319325569

Since the classic determinant computation method Cholesky decomposition may devastate sparsity of matrices and cost cubic steps, it is impractical to apply this method to large-scale symmetric positive-definite matrices due to limitation of storage and efficiency. Therefore, a randomized algorithm is proposed to calculate log-determinants of symmetric positive-definite matrices via stochastic trace approximations, implemented by weighted L-2 orthogonal polynomial expansions with efficient recursion formulas and matrix-vector multiplications based on the matrix eigenvalue distribution. As Chebyshev expansions have been applied to this problem before, our main contribution is proposing the strategies of weighted function selection based on prior eigenvalue distribution, which generalizes approximating polynomials for this problem and may accelerate computation.

关键词： Log-determinant Best approximation Eigenvalue distribution randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

A Robust and Fast Reputation System for Online Rating Systems 1

引用

18th International Conference on Web Information Systems Engineering (WISE)

作者： Rezvani, Mohsen Rezvani, Mojtaba Shahrood Univ Technol Shahrood Iran Australian Natl Univ Canberra ACT Australia

ISBN: (数字)9783319687865

ISBN: (纸本)9783319687865;9783319687858

Recent studies have shown that reputation escalation is emerging as a new service, by which dealers pay to receive good feedback and escalate their ratings in online shopping markets. With the dramatic increase in the number of ratings provided by consumers, scalability has arisen as a significant issue in the existing methods of reputation systems. In order to tackle such issue, we here propose a fast algorithm that calculates the reputation based on a random sample of the ratings. Since the randomly selected sample has a logarithmic size, it guarantees a feasible scalability for large-scale online review systems. In addition, the randomness nature of the algorithm makes it robust against unfair ratings. We analyze the effectiveness of the proposed algorithm through extensive empirical evaluation using real world and synthetically generated datasets. Our experimental results show that the proposed method provides a high accuracy while running much faster than the existing iterative filtering approach.

关键词： Reputation system Data aggregation randomized algorithm Trust computation Online rating

来源：评论

学校读者我要写书评

暂无评论

On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement 23

On the Message Complexity of Fault-Tolerant Computation: Lea...

引用

24th International Conference on Distributed Computing and Networking (ICDCN)

作者： Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata India

ISBN: (纸本)9781450397964

Our paper investigates the message complexity of two fundamental problems, leader election and agreement, in the crash-fault synchronous and fully-connected distributed network. We present randomized algorithms for both the problems and also show non-trivial lower bounds on the message complexity. Our algorithms achieve sublinear message complexity in the so-called implicit version of the two problems when tolerating more than a constant fraction of the faulty nodes. In comparison to the state-of-art, our results improved and extended the works of [Gilbert-Kowalski, SODA'10] (which studied only the agreement problem) in several directions. Specifically, our algorithms tolerate any number of faulty nodes up to (n - polylog n). The message complexity (and also the time complexity) of our algorithms is optimal (up to a polylog n factor). Further, our algorithm works in anonymous networks, where nodes do not know each other. To the best of our knowledge, these are the first sublinear results for both the leader election and the agreement problem in the crash-fault distributed networks. A full version of the paper is available at [3]

关键词： Distributed algorithm randomized algorithm fault-tolerant algorithm crash-fault leader election agreement message complexity

来源：评论

学校读者我要写书评

暂无评论

Counting distinct items over update streams

引用

16th International Symposium on algorithms and Computations (ISAAC 2005)

作者： Ganguly, Sumit Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 Uttar Pradesh India

ISBN: (纸本)3540309357

In data streaming applications, data arrives at rapid rates and in high volume, thus making it essential to process each stream update very efficiently in terms of both time and space. A data stream is a sequence of data records that must be processed continuously in an online fashion using sub-linear space and sub-linear processing time. We consider the problem of tracking the number of distinct items over data streams that allow insertion and deletion operations. We present two algorithms that improve on the space and time complexity of existing algorithms. (c) 2007 Elsevier B. V. All rights reserved.

关键词： randomized algorithm online algorithm data stream distinct items negative dependence

来源：评论

学校读者我要写书评

暂无评论

Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization

Interaction Testing, Fault Location, and Anonymous Attribute...

引用

作者： Lanus, Erin Arizona State University

学位级别：Ph.D.

This dissertation studies three classes of combinatorial arrays with practical applications in testing, measurement, and security. Covering arrays are widely studied in software and hardware testing to indicate the presence of faulty interactions. Locating arrays extend covering arrays to achieve identification of the interactions causing a fault by requiring additional conditions on how interactions are covered in rows. This dissertation introduces a new class, the anonymizing arrays, to guarantee a degree of anonymity by bounding the probability a particular row is identified by the interaction presented. Similarities among these arrays lead to common algorithmic techniques for their construction which this dissertation explores. Differences arising from their application domains lead to the unique features of each class, requiring tailoring the techniques to the specifics of each problem. One contribution of this work is a conditional expectation algorithm to build covering arrays via an intermediate combinatorial object. Conditional expectation efficiently finds intermediate-sized arrays that are particularly useful as ingredients for additional recursive algorithms. A cut-and-paste method creates large arrays from small ingredients. Performing transformations on the copies makes further improvements by reducing redundancy in the composed arrays and leads to fewer rows. This work contains the first algorithm for constructing locating arrays for general values of d and t. A randomized computational search algorithmic framework verifies if a candidate array is (&dmacr;,t)-locating by partitioning the search space and performs random resampling if a candidate fails. algorithmic parameters determine which columns to resample and when to add additional rows to the candidate array. Additionally, analysis is conducted on the performance of the algorithmic parameters to provide guidance on how to tune parameters to prioritize speed, accuracy, or a combination of both. T

关键词： Computer science attribute-based access control combinatorial testing covering array locating array randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Constant Factor Approximations to Edit Distance on Far Input Pairs in Nearly Linear Time 2020

Constant Factor Approximations to Edit Distance on Far Input...

引用

52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Koucky, Michal Saks, Michael Charles Univ Prague Comp Sci Inst Prague Czech Republic Rutgers State Univ Dept Math Piscataway NJ USA

ISBN: (纸本)9781450369794

For any T >= 1, there are constants R = R(T) > 1 and zeta = zeta((T) > 0 and a randomized algorithm that takes as input an integer n and two strings x, y of length at most n, and runs in time O(n(1+1/T)) and outputs an upper bound U on the edit distance of d(edit)(x, y) that with high probability, satisfies U <= R(d(edit)(x, y) + n(1-zeta)). particular, on any input with d(edit)(x, y) >= n(1-zeta) the algorithm outputs a constant factor approximation with high probability. A similar result has been proven independently by Brakensiek and Rubinstein (this proceedings).

关键词： edit distance approximation algorithm almost linear-time algorithm randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共63页 << < 44 45 46 47 48 49 50 51 52 53 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：