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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

477 篇 期刊文献
144 篇 会议
5 篇 学位论文
2 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

628 篇 randomized algor...
31 篇 approximation al...
25 篇 distributed algo...
19 篇 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...

语言

585 篇 英文
38 篇 其他
5 篇 中文
1 篇 德文

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

共 628 条记录，以下是511-520 订阅

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

详细简洁

排序：

odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks 21

odeN: Simultaneous Approximation of Multiple Motif Counts in...

引用

30th ACM International Conference on Information and Knowledge Management (CIKM)

作者： Sarpe, The Vandin, Fabio Univ Padua Dept Informat Engn Padua Italy

ISBN: (纸本)9781450384469

Counting the number of occurrences of small connected subgraphs, called temporal motifs, has become a fundamental primitive for the analysis of temporal networks, whose edges are annotated with the time of the event they represent. One of the main complications in studying temporal motifs is the large number of motifs that can be built even with a limited number of vertices or edges. As a consequence, since in many applications motifs are employed for exploratory analyses, the user needs to iteratively select and analyze several motifs that represent different aspects of the network, resulting in an inefficient, time-consuming process. This problem is exacerbated in large networks, where the analysis of even a single motif is computationally demanding. As a solution, in this work we propose and study the problem of simultaneously counting the number of occurrences of multiple temporal motifs, all corresponding to the same (static) topology (e.g., a triangle). Given that for large temporal networks computing the exact counts is unfeasible, we propose odeN, a sampling-based algorithm that provides an accurate approximation of all the counts of the motifs. We provide analytical bounds on the number of samples required by odeN to compute rigorous, probabilistic, relative approximations. Our extensive experimental evaluation shows that odeN enables the approximation of the counts of motifs in temporal networks in a fraction of the time needed by state-of-the-art methods, and that it also reports more accurate approximations than such methods.

关键词： temporal motifs sampling algorithm temporal networks randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Finding the k most vital edges with respect to minimum spanning tree

Finding the k most vital edges with respect to minimum spann...

引用

IEEE 1997 National Aerospace and Electronics Conference (NAECON 1997)

作者： Shen, H Griffith Univ Nathan Australia

ISBN: (纸本)0780337263

For a connected, undirected and weighted graph G = (V, E), the problem of finding the k most vital edges of G with respect to minimum spanning tree is to find k edges in G whose removal will cause greatest weight increase in the minimum spanning tree of the remaining graph. This problem is known to be NP-hard for arbitrary k. In this paper, we first describe a simple exact algorithm for this problem, based on the approach of edge replacement in the minimum spanning tree of G. Next we present polynomial-time randomized algorithms that produce optimal and approximate solutions to this problem. For /V/ = n and /E/ = m, our algorithm producing optimal solution has a time complexity of O(mn) with probability of success at least E-k2/2(m-n-1 - 2 log(c) k/k = 4), c = 1 + 1/2(k/2), and the algorithm producing approximate solution runs in time O(mn + nk(2) log k) and yields results within factor 2 to the optimal one. Finally we show that both of our randomized algorithms can be easily parallelized. On a CREW PRAM the first algorithm runs in O(n) time using n(2) processors, and the second algorithm runs in O(log(2) n) time using mn/log n processors.

关键词： minimum spanning tree most vital edge parallel algorithm randomized algorithm PRAM

来源：评论

学校读者我要写书评

暂无评论

Advanced optimization methods for power systems

Advanced optimization methods for power systems

引用

2014 Power Systems Computation Conference (PSCC)

作者： Panciatici, P. Campi, M. C. Garatti, S. Low, S. H. Molzahn, D. K. Sun, A. X. Wehenkel, L. RTE R&D Dept Versailles France Univ Brescia Dept Informat Engn Brescia Italy Politecn Milan Dept Elect Comp Sci & Bioengn Milan Italy CALTECH Div Engn & Appl Sci Pasadena CA 91125 USA Univ Michigan Dept EE&CS Ann Arbor MI 48109 USA Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Liege Dept EE&CS Inst Montefiore B-4000 Liege Belgium

ISBN: (纸本)9788393580132

Power system planning and operation offers multitudinous opportunities for optimization methods. In practice, these problems are generally large-scale, non-linear, subject to uncertainties, and combine both continuous and discrete variables. In the recent years, a number of complementary theoretical advances in addressing such problems have been obtained in the field of applied mathematics. The paper introduces a selection of these advances in the fields of non-convex optimization, in mixed-integer programming, and in optimization under uncertainty. The practical relevance of these developments for power systems planning and operation are discussed, and the opportunities for combining them, together with high-performance computing and big data infrastructures, as well as novel machine learning and randomized algorithms, are highlighted.

关键词： Big Data concave programming integer programming learning (artificial intelligence) nonlinear programming parallel processing power engineering computing power system planning randomised algorithms Big Data infrastructure advanced optimization method high-performance computing machine learning mixed integer programming nonconvex optimization power system operation randomized algorithm Electronic mail Europe Linear programming Optimization Planning Power systems Uncertainty Power system planning randomized algorithms Integer Programming power systems High Performance Computing big data Power engineering computing electronic mail Nonlinear Programming PARALLEL PROCESSING (COMPUTERS) Optimization methods linear programming Uncertainty

来源：评论

学校读者我要写书评

暂无评论

A collaborative approach to stochastic load balancing with networked queues of autonomous service clusters

A collaborative approach to stochastic load balancing with n...

引用

International Conference on Collaborative Computing

作者： Lai, Cheng-Jia Polak, Wolfgang FX Palo Alto Lab 3400 Hillview AveBuilding 4 Palo Alto CA 94304 USA

ISBN: (纸本)9781424404285

Load balancing has been an increasingly important issue for handling computational intensive tasks in a distributed system such as in Grid and cluster computing. In such systems, multiple server instances are installed for handling requests from client applications, and each request (or task) typically needs to stay in a queue before an available server is assigned to process it. In this paper, we propose a high-performance queueing method for implementing a shared queue for collaborative clusters of servers. Each cluster of servers maintains a local queue and queues of different clusters are networked to form a unified (or shared) queue that may dispatch tasks to all available servers. We propose a new randomized algorithm for forwarding requests in an overcrowded local queue to a networked queue based on load information of the local and neighboring clusters. The algorithm achieves both load balancing and locality awareness.

关键词： groupware queueing theory randomised algorithms resource allocation workstation clusters autonomous service cluster collaborative server cluster high performance queueing locality awareness networked queue randomized algorithm shared queue stochastic loa

来源：评论

学校读者我要写书评

暂无评论

Balls into bins via local search: cover time and maximum load 31

Balls into bins via local search: cover time and maximum loa...

引用

31st International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Bringmann, Karl Sauerwald, Thomas Stauffer, Alexandre Sun, He Max Planck Inst Informat Saarbrucken Germany Univ Cambridge Cambridge England Univ Bath Bath Avon England

ISBN: (纸本)9783939897651

We study a natural process for allocating in balls into n bins that are organized as the vertices of an undirected graph G. Balls arrive one at a time. When a ball arrives, it first chooses a vertex u in G uniformly at random. Then the ball performs a local search in G starting from u until it reaches a vertex with local minimum load, where the ball is finally placed on. Then the next ball arrives and this procedure is repeated. For the case m = n, we give an upper bound for the maximum load on graphs with bounded degrees. We also propose the study of the cover time of this process, which is defined as the smallest in so that every bin has at least one ball allocated to it. We establish an upper bound for the cover time on graphs with bounded degrees. Our bounds for the maximum load and the cover time are tight when the graph is vertex transitive or sufficiently homogeneous. We also give upper bounds for the maximum load when m >= n.

关键词： Balls and Bins Stochastic Process randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Tossing Coins to Trim Long Queries 11

Tossing Coins to Trim Long Queries

引用

34th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)

作者： Datta, Sudip Varma, Vasudeva Int Inst Informat Technol Language Technol Res Ctr Hyderabad 500032 India

ISBN: (纸本)9781450309349

Verbose web queries are often descriptive in nature where a term based search engine is unable to distinguish between the essential and noisy words, which can result in a drift from the user intent. We present a randomized query reduction technique that builds on an earlier learning to rank based approach. The proposed technique randomly picks only a small set of samples, instead of the exponentially many sub-queries, thus being fast enough to be useful for web search engines, while still covering wide sub-query space.

关键词： Verbose Queries randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dynamic Set Cover: Improved algorithms and Lower Bounds 2019

Dynamic Set Cover: Improved Algorithms and Lower Bounds

引用

51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Abboud, Amir Addanki, Raghavendra Grandoni, Fabrizio Panigrahi, Debmalya Saha, Barna IBM Almaden Res Ctr San Jose CA 95120 USA Univ Massachusetts Amherst Amherst MA USA IDSIA USI SUPSI Manno Switzerland Duke Univ Durham NC USA

ISBN: (纸本)9781450367059

We give new upper and lower bounds for the dynamic set cover problem. First, we give a (1 + epsilon)f-approximation for fully dynamic set cover in O(f(2) log n/epsilon(5)) (amortized) update time, for any epsilon > 0, where f is the maximum number of sets that an element belongs to. In the decremental setting, the update time can be improved to O(f(2)/epsilon(5)), while still obtaining an (1 + epsilon)f-approximation. These are the first algorithms that obtain an approximation factor linear in f for dynamic set cover, thereby almost matching the best bounds known in the offline setting and improving upon the previous best approximation of O(f(2)) in the dynamic setting. To complement our upper bounds, we also show that a linear dependence of the update time on f is necessary unless we can tolerate much worse approximation factors. Using the recent distributed PCP-framework, we show that any dynamic set cover algorithm that has an amortized update time of O(f(1-epsilon)) must have an approximation factor that is Omega(n(delta)) for some constant delta > 0 under the Strong Exponential Time Hypothesis.

关键词： dynamic algorithm randomized algorithm set cover competitive ratio

来源：评论

学校读者我要写书评

暂无评论

Fast Matrix Rank algorithms and Applications 12

Fast Matrix Rank Algorithms and Applications

引用

44th ACM Annual Symposium on Theory of Computing (STOC)

作者： Cheung, Ho Yee Kwok, Tsz Chiu Lau, Lap Chi Chinese Univ Hong Kong H ongKong Peoples R China Univ Southern Calif Los Angeles CA USA

ISBN: (纸本)9781450312455

We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in (O) over tilde (vertical bar A vertical bar + r(omega)) field operations, where vertical bar A vertical bar denotes the number of nonzero entries in A and omega < 2.38 is the matrix multiplication exponent. Previously the best known algorithm to find a set of r linearly independent columns is by Gaussian elimination, with running time O(mnr(omega-2)). Our algorithm is faster when r < max{m, n}, for instance when the matrix is rectangular. We also consider the problem of computing the rank of a matrix dynamically, supporting the operations of rank one updates and additions and deletions of rows and columns. We present an algorithm that updates the rank in (O) over tilde (mn) field operations. We show that these algorithms can be used to obtain faster algorithms for various problems in numerical linear algebra, combinatorial optimization and dynamic data structure.

关键词： Matrix Rank Numerical Linear Algebra Combinatorial Optimization 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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共63页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：