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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

630 篇 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...

语言

586 篇 英文
37 篇 其他
5 篇 中文
1 篇 德文

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

共 630 条记录，以下是501-510 订阅

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

详细简洁

排序：

VECTOR ADDRESSING FOR NON-SEQUENTIAL SAMPLING IN FIR IMAGE FILTERING 26

VECTOR ADDRESSING FOR NON-SEQUENTIAL SAMPLING IN FIR IMAGE F...

引用

26th IEEE International Conference on Image Processing (ICIP)

作者： Fukushima, Norishige Tsubokawa, Teppei Maeda, Yoshihiro Nagoya Inst Technol Nagoya Aichi Japan

ISBN: (纸本)9781538662496

Image filtering is fundamental in image processing. The acceleration is essential since image resolution has highly increased. For the acceleration, image subsampling is a general approach for any filtering. However, this approach has a drawback in accuracy due to image aliasing. Several papers moderate this problem by subsampling image or filtering kernel non-sequential sampling. In this paper, we improve the sampling combined with image and kernel subsampling. We also accelerate the work of non-sequential sampling by vector addressing of hardware acceleration. Experimental results show that the proposed method accelerate bilateral filtering and adaptive Gaussian filtering. Also, the proposed vector addressing accelerate both filters.

关键词： randomized algorithm randomized subsampling edge-preserving filtering vector addressing

来源：评论

学校读者我要写书评

暂无评论

Monitoring schedules for randomly deployed sensor networks without geographic information

Monitoring schedules for randomly deployed sensor networks w...

引用

12th International Symposium on Pervasive Systems, algorithms, and Networks (I-SPAN)

作者： Calinescu, G. IIT Dept Comp Sci Chicago IL 60616 USA

ISBN: (纸本)9780769549309

Given n sensors and m targets, a monitoring schedule is a partition of the sensor set such that each part of the partition can monitor all targets. Monitoring schedules are used to maximize the time all targets are monitored when there is no possibility of replacing the batteries of the sensors. Each part of the partition is used for one unit of time, and thus the goal is to maximize the number of parts in the partition. We present distributed algorithms for Monitoring Schedule under the following assumptions: 1) identical sensors can each monitor all targets within a certain radius, 2) the n sensors are randomly distributed uniformly in a large square containing the targets, 3) the number of sensors is high enough given the area the square, and 4) the communication range is at least a constant times the the sensing range. We present randomized distributed algorithms that achieve a constant factor approximation in polylogarithmic number of communication rounds, with high probability. These results hold if we make one of the following two assumptions: 1) any two sensors within communication range are able to estimate within a constant their relative distance, or 2) the communication range is an exact fraction of the sensing range. We improve the results of Calinescu and Ellis (DIAL M-POMC '08) by eliminating the assumption that the communication range must be twice the sensing range, and by this result holding with fewer sensors.

关键词： wireless network distributed algorithm randomized algorithm area monitoring

来源：评论

学校读者我要写书评

暂无评论

SUPPORT VECTOR MACHINE (SVM) FOR ENGLISH HANDWRITTEN CHARACTER RECOGNITION

SUPPORT VECTOR MACHINE (SVM) FOR ENGLISH HANDWRITTEN CHARACT...

引用

2nd International Conference on Computer Engineering and Applications

作者： Nasien, Dewi Haron, Habibollah Yuhaniz, Siti Sophiayati Univ Teknol Malaysia Dept Modeling & Ind Comp Johor Baharu Malaysia

ISBN: (纸本)9780769539829

This paper proposes a recognition model for English handwritten (lowercase, uppercase and letter) character recognition that uses Freeman chain code (FCC) as the representation technique of an image character. Chain code representation gives the boundary of a character image in which the codes represent the direction of where is the location of the next pixel. An FCC method that uses 8-neighbourhood that starts from direction labelled as 1 to 8 is used. randomized algorithm is used to generate the FCC. After that, features vector is built. The criteria of features to input the classification is the chain code that converted to 64 features. Support vector machine (SVM) is chosen for the classification step. NIST Databases are used as the data in the experiment. Our test results show that by applying the proposed model, we reached a relatively high accuracy for the problem of English handwritten recognition.

关键词： Freeman chain code (FCC) Heuristic method randomized algorithm features vector Support vector machine (SVM)

来源：评论

学校读者我要写书评

暂无评论

Fast Hamiltonicity Checking via Bases of Perfect Matchings 13

Fast Hamiltonicity Checking via Bases of Perfect Matchings

引用

45th Annual ACM Symposium on the Theory of Computing (STOC)

作者： Cygan, Marek Kratsch, Stefan Nederlof, Jesper Univ Warsaw Warsaw Poland Tech Univ Berlin Berlin Germany Univ Utrecht Utrecht Netherlands

ISBN: (纸本)9781450320290

For an even integer t >= 2, the Matching Connectivity matrix H-t is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph K-t on t vertices;an entry H-t[M-1, M-2] is 1 if M-1 U M-2 is a Hamiltonian cycle and 0 otherwise. Motivated by the computational study of the Hamiltonicity problem, we present three results on the structure of H-t: We first show that H-t has rank exactly 2(t/2-1) over GF(2) via an appropriate factorization that explicitly provides families of matchings X-t forming bases for H-t. Second, we show how to quickly change representation between such bases. Third, we notice that the sets of matchings X-t induce permutation matrices within H-t. We use the factorization to derive an 1.888(n) n(O(1)) time Monte Carlo algorithm that solves the Hamiltonicity problem in directed bipartite graphs. Our algorithm as well counts the number of Hamiltonian cycles modulo two in directed bipartite or undirected graphs in the same time bound. Moreover, we use the fast basis change algorithm from the second result to present a Monte Carlo algorithm that given an undirected graph on n vertices along with a path decomposition of width at most pw decides Hamiltonicity in (2 + root 2)P(w)n(O(1)) time. Finally, we use the third result to show that for every epsilon > 0 this cannot be improved to (2 + root 2 - epsilon)P-w n(O(1)) time unless the Strong Exponential Time Hypothesis fails, i.e., a faster algorithm for this problem would imply the breakthrough result of an O((2 - epsilon ')(n)) time algorithm for CNF-Sat.

关键词： Hamiltonicity perfect matchings matrix rank dynamic programming pathwidth 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

来源：评论

学校读者我要写书评

暂无评论

Replacement Paths via Fast Matrix Multiplication

Replacement Paths via Fast Matrix Multiplication

引用

IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)

作者： Weimann, Oren Yuster, Raphael Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel Univ Haifa Dept Math Haifa Israel

ISBN: (纸本)9780769542447

Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t path that avoids e. Apart from approximation algorithms and algorithms for special graph classes, the naive solution to this problem removing each edge e on P one at a time and computing the shortest s-to-t path each time - is surprisingly the only known solution for directed weighted graphs, even when the weights are integrals. In particular, although the related shortest paths problem has benefited from fast matrix multiplication, the replacement paths problem has not, and still required cubic time. For an n-vertex graph with integral edge-lengths between -M and M, we give a randomized algorithm that uses fast matrix multiplication and is sub-cubic for appropriate values of M. We also show how to construct a distance sensitivity oracle in the same time bounds. A query (u,v,e) to this oracle requires sub-quadratic time and returns the length of the shortest u-to-v path that avoids the edge e. In fact, for any constant number of edge failures, we construct a data structure in sub-cubic time, that answer queries in sub-quadratic time. Our results also apply for avoiding vertices rather than edges.

关键词： approximation algorithm data structure directed edge-weighted graph directed graphs distance sensitivity oracle fast matrix multiplication matrix algebra randomised algorithms randomized algorithm replacement path sub-quadratic time

来源：评论

学校读者我要写书评

暂无评论

Regularities Considered Harmful: Forcing Randomness to Memory Accesses to Reduce Row Buffer Conflicts for Multi-Core, Multi-Bank Systems 13

Regularities Considered Harmful: Forcing Randomness to Memor...

引用

18th International Conference on Architectural Support for Programming Languages and Operating Systems

作者： Park, Heekwon Baek, Seungjae Choi, Jongmoo Lee, Donghee Noh, Sam H. Univ Pittsburgh Dept Comp Sci Pittsburgh PA 15260 USA Dankook Univ Dept Comp Sci Seoul South Korea Univ Seoul Sch Comp Sci Seoul South Korea Hongik Univ Sch Comp & Informat Engn Seoul South Korea

ISBN: (纸本)9781450318709

We propose a novel kernel-level memory allocator, called M-3 (M-cube, Multi-core Multi-bank Memory allocator), that has the following two features. First, it introduces and makes use of a notion of a memory container, which is defined as a unit of memory that comprises the minimum number of page frames that can cover all the banks of the memory organization, by exclusively assigning a container to a core so that each core achieves bank parallelism as much as possible. Second, it orchestrates page frame allocation so that pages that threads access are dispersed randomly across multiple banks so that each thread's access pattern is randomized. The development of M-3 is based on a tool that we develop to fully understand the architectural characteristics of the underlying memory organization. Using an extension of this tool, we observe that the same application that accesses pages in a random manner outperforms one that accesses pages in a regular pattern such as sequential or same ordered accesses. This is because such randomized accesses reduces inter-thread access interference on the rowbuffer in memory banks. We implement M-3 in the Linux kernel version 2.6.32 on the Intel Xeon system that has 16 cores and 32GB DRAM. Performance evaluation with various workloads show that M-3 improves the overall performance for memory intensive benchmarks by up to 85% with an average of about 40%.

关键词： algorithms Design Experimentation Measurement Performance Row-buffer conflict Memory management randomized algorithm Memory container Analysis tool

来源：评论

学校读者我要写书评

暂无评论

A modified ant algorithm for solving the quadratic assignment problem

A modified ant algorithm for solving the quadratic assignmen...

引用

International Conference on Intelligent Pervasive Computing (IPC 2007)

作者： Qi, Chengming Beijing Union Univ Coll Automat Beijing 100101 Peoples R China

ISBN: (纸本)9780769530062

The Quadratic Assignment Problem(QAP) is one of the hardest combinatorial optimization problems known. Ant algorithms have been inspired by the behavior of real ant colonies. In this paper, we introduce random algorithm to the constructive procedure of the solution of Ant System (AS) and adopt dynamic adaptive approach to update pheromone trails. In our algorithm, only partial facilities are randomly chosen to compute the designed probability. Experimental results for solving the QAP demonstrate that the proposed approach can obtain the better quality of the solutions.

关键词： ant system combinatorial optimization randomized algorithm QAP

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Robust Control Method for a Small UAV with Bounded Uncertainty 35

A Probabilistic Robust Control Method for a Small UAV with B...

引用

第35届中国控制会议

作者： XIE Rong WANG Xinmin WANG Jian CAO Yuyan LI Ting School of Automation Northwestern Polytechnical University

ISBN: (纸本)9781509009107

This paper proposes a probabilistic robust control approach for a small unmanned aerial vehicle(UAV) in longitudinal ight. In the proposed method, the stochastic behavior of uncertainty parameters is considered in solving a high-performance robust controller of UAV. Compared to deterministic robust control, this solution has two advantages:(a) the controller obtained by the proposed method has xed order;(b) it is less-conservative and more reasonable for controlling ight control systems with bounded uncertainty. Simulation results for an UAV in longitudinal motion are given to show the effectiveness of the proposed approach.

关键词： Probabilistic robust control Flight Control Bounded uncertainty randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Precise interprocedural analysis using random interpretation

Precise interprocedural analysis using random interpretation

引用

32nd 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

We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural analyses. There is no such natural extension known for deterministic algorithms. We present a general technique for extending any intraprocedural random interpreter to perform a context-sensitive interprocedural analysis with only polynomial increase in running time. This technique involves computing random summaries of procedures, which are complete and probabilistically sound. As an instantiation of this general technique, we obtain the first polynomial-time randomized algorithm that discovers all linear relationships interprocedurally in a linear program. We also obtain the first polynomial-time randomized algorithm for precise interprocedural value numbering over a program with unary uninterpreted functions. We present experimental evidence that quantifies the precision and relative speed of the analysis for discovering linear relationships along two dimensions: intraprocedural vs. interprocedural, and deterministic vs. randomized. We also present results that show the variation of the error probability in the randomized analysis with changes in algorithm parameters. These results suggest that the error probability is much lower than the existing conservative theoretical bounds.

关键词： algorithms theory verification interprocedural analysis random interpretation randomized algorithm linear relationships uninterpreted functions interprocedural value numbering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：