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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

22,901 篇 会议
9,194 篇 期刊文献
50 篇 学位论文

馆藏范围

32,145 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

16,123 篇 工学
- 10,123 篇 计算机科学与技术...
- 4,995 篇 电气工程
- 3,163 篇 软件工程
- 2,714 篇 信息与通信工程
- 1,965 篇 控制科学与工程
- 740 篇 机械工程
- 680 篇 电子科学与技术（可...
- 626 篇 航空宇航科学与技...
- 531 篇 仪器科学与技术
- 228 篇 交通运输工程
- 213 篇 材料科学与工程（可...
- 204 篇 化学工程与技术
- 168 篇 生物工程
- 156 篇 测绘科学与技术
- 138 篇 生物医学工程（可授...
- 135 篇 土木工程
- 133 篇 动力工程及工程热...
10,429 篇 理学
- 9,335 篇 数学
- 914 篇 物理学
- 769 篇 系统科学
- 734 篇 统计学（可授理学、...
- 262 篇 生物学
- 245 篇 化学
- 125 篇 地球物理学
2,486 篇 管理学
- 1,921 篇 管理科学与工程(可...
- 674 篇 工商管理
- 560 篇 图书情报与档案管...
414 篇 经济学
- 385 篇 应用经济学
205 篇 医学
- 173 篇 临床医学
171 篇 法学
- 168 篇 社会学
131 篇 文学
128 篇 农学
36 篇 教育学
27 篇 军事学
11 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

32,145 篇 approximation al...
2,770 篇 algorithm design...
2,363 篇 optimization
2,321 篇 approximation me...
2,189 篇 heuristic algori...
1,428 篇 convergence
1,425 篇 linear programmi...
1,289 篇 computational mo...
1,223 篇 resource managem...
1,158 篇 signal processin...
956 篇 computer science
919 篇 polynomials
917 篇 clustering algor...
915 篇 complexity theor...
792 篇 mathematical mod...
766 篇 vectors
710 篇 programming
662 篇 estimation
629 篇 training
614 篇 transportation

机构

97 篇 univ maryland de...
69 篇 technion israel ...
56 篇 univ waterloo de...
50 篇 cornell univ dep...
44 篇 tsinghua univers...
39 篇 national institu...
39 篇 iit dept comp sc...
39 篇 carnegie mellon ...
35 篇 national mobile ...
34 篇 shandong univ sc...
32 篇 sichuan univ col...
31 篇 school of comput...
31 篇 nanjing univ sta...
30 篇 univ chinese aca...
29 篇 technion haifa
29 篇 suny stony brook...
28 篇 epfl
28 篇 hong kong polyte...
28 篇 tel aviv univers...
28 篇 princeton univ p...

作者

64 篇 woodruff david p...
64 篇 ravi r.
53 篇 kortsarz guy
45 篇 lee euiwoong
43 篇 levin asaf
41 篇 chan timothy m.
40 篇 kumar amit
37 篇 chen zhi-zhong
36 篇 friggstad zachar...
33 篇 kawarabayashi ke...
32 篇 manurangsi pasin
31 篇 wang lusheng
31 篇 chalermsook pari...
29 篇 thai my t.
29 篇 williamson david...
29 篇 carmi paz
29 篇 gudmundsson joac...
28 篇 saha barna
28 篇 shmoys david b.
28 篇 zenklusen rico

语言

30,922 篇 英文
1,066 篇 其他
117 篇 中文
9 篇 日文
6 篇 俄文
2 篇 西班牙文
2 篇 法文
1 篇 土耳其文
1 篇 乌克兰文

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

共 32145 条记录，以下是4471-4480 订阅

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

详细简洁

排序：

Performance Comparison of K-SVD, Discriminative K-SVD, and Approximate K-SVD Dictionary Learning algorithms for Public Road Type Recognition

Performance Comparison of K-SVD, Discriminative K-SVD, and A...

引用

International Conference on Signal Processing and Communication (ICSC)

作者： Ashwin Rai Pubali De Saibal Ghosh Pritam Paral Amitava Chatterjee Business Analyst Deloitte Touche Tohmatsu India LLP Institute of Engineering and Management University of Engineering and Management Kolkata India Dept. of Electrical Engineering. Jadavpur University Kolkata India Dept. of Electrical Engineering. IIEST Shibpur Howrah India Electrical Engineering Department Jadavpur University Kolkata India

ISBN: (数字)9798331511890

ISBN: (纸本)9798331511906

In today's world, having the ability to drive has become of significant importance, especially while traveling. As a consequence, the importance of studying road safety is rising. Hence, the importance of research in designing intelligent systems to aid drivers in providing comfort, security, and safety is also gaining much momentum in recent times. On the other hand, designing Dictionary learning (DL) algorithms in conjunction with sparse representation/coding has become a forerunner in machine learning based research problems in the current decade. Many such DL based sparse solutions have been effectively proposed for a variety of signal processing and image processing algorithms. In some of our earlier works, we have shown how various dictionary learning based algorithms and system solutions can be successfully developed for home automation and ambient assisted leaving problems. Taking our research efforts in DL algorithms further, in this work we show how DL algorithms can be effectively used to categorize four common road types: urban roads, highways, residential areas, and rural areas. The algorithms have been developed based on sensory signals acquired by a driver wearing smart glasses, while driving in those road conditions. The DL based system developed can help providing guidance to a driver during driving. Three prominent varieties of DL algorithms, called K-singular value decomposition (K-SVD) algorithm, approximate K-SVD algorithm, and discriminative K-SVD algorithm, have been successfully implemented here for a benchmark, open dataset available for this problem and their suitable effectiveness has been investigated in detail. Although all the three varieties of K-SVD algorithms showed encouraging performances under different recognition problems, the discriminative K-SVD algorithm, employing orthogonal matching pursuit (OMP) algorithm at its core for sparse coding purposes, emerged as the best overall performer.

关键词： Machine learning algorithms Roads Signal processing algorithms Matching pursuit algorithms Machine learning Signal processing approximation algorithms Safety Vehicles Smart glasses

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Secure Communication in Coupled Phase-Shift STAR-RIS Aided MU-MISO Systems

Energy-Efficient Secure Communication in Coupled Phase-Shift...

引用

Computer Applications and Information Technology (ISCAIT), International Symposium on

作者： Xianwei Yu Kaida Peng Chang Feng Yulong Han School of Information Science and Technology North China University of Technology Beijing China

ISBN: (数字)9798331542856

ISBN: (纸本)9798331542863

This paper explores the energy-efficient secure communication design enabled by simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). In particular, we consider a coupled phase-shift STAR-RIS aided downlink network within a multi-user multiple-input single-output (MU-MISO) system, where eavesdroppers are present. To optimize the system’s secrecy energy efficiency (SEE), we jointly design the secure beamforming and STAR-RIS coefficients. An alternating optimization (AO) framework is proposed to tackle the non-convexity of the problem. Specifically, the beamforming is configured via the successive convex approximation (SCA) algorithm, while closed-form solutions for the coupled STAR-RIS coefficients are derived using the penalty dual decomposition (PDD) framework. Numerical results validate the algorithm’s effectiveness in enhancing both energy efficiency and security, and reveal the trade-off between hardware feasibility and performance.

关键词： Array signal processing Stars Reconfigurable intelligent surfaces approximation algorithms Energy efficiency Hardware Vectors Reflection Security Optimization

来源：评论

学校读者我要写书评

暂无评论

Online and Streaming algorithms for Constrained k-Submodular Maximization 39

Online and Streaming Algorithms for Constrained k-Submodular...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Spaeh, Fabian Christian Ene, Alina Nguyen, Huy Department of Computer Science Boston University United States Khoury College of Computer Science Northeastern University United States

ISBN: (纸本)157735897X

Constrained k-submodular maximization is a general framework that captures many discrete optimization problems such as ad allocation, influence maximization, personalized recommendation, and many others. In many of these applications, datasets are large or decisions need to be made in an online manner, which motivates the development of efficient streaming and online algorithms. In this work, we develop single-pass streaming and online algorithms for constrained k-submodular maximization with both monotone and general (possibly non-monotone) objectives subject to cardinality and knapsack constraints. Our algorithms achieve provable constant-factor approximation guarantees which improve upon the state of the art in almost all settings. Moreover, they achieve the fastest known running times and have optimal space usage. We experimentally evaluate our algorithms on instances for ad allocation and other applications, where we observe that our algorithms are practical and scalable, and construct solutions that are comparable in value even to offline greedy algorithms. Copyright © 2025, Association for the Advancement of Artificia Intelligence (***). All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum-Enhanced Deep Learning for Predictive Diagnostics and Personalized Treatment in Smart Healthcare Systems

Quantum-Enhanced Deep Learning for Predictive Diagnostics an...

引用

Pervasive Computing and Social Networking (ICPCSN), International Conference on

作者： R. Rajesh P. Hemalatha R. Vijayabharathi S. Bargunan S. R. Ramprasad J. Raja Department of Computer Science and Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai India Department of Computer Science and Engineering R.M.K. Engineering College Chennai India Department of Computer Science and Design R.M.K. Engineering College Chennai India Department of Computer Science and Design Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology Chennai India

ISBN: (数字)9798331535193

ISBN: (纸本)9798331535209

The synergy between quantum computing and deep learning holds revolutionary promise in facilitating smart healthcare by addressing problems in predictive diagnosis, realtime patient tracking, and personalized therapy. Deep learning algorithms such as CNNs and RNNs have scalability and efficiency limitations in processing clinical data with high dimensionality. Their limitations can be addressed by quantum computing through an inbuilt parallelism. This work suggests that Quantum-Enhanced Deep Learning for Smart Healthcare (QEDL-Health) should marry classical deep learning with quantum algorithms to revamp paradigms in healthcare. QEDL-Health applies quantum neural networks (QNNs) with quantum gates (Pauli-X, Hadamard, CNOT) to perform encoding and feature extraction efficiently. Model parameters are trained by quantum variational circuits (QVCs), while quantum support vector machines (QSVMs) diagnose diseases with better accuracy. IoT-generated vitals in real-time tracking are processed by quantum principal component analysis (QPCA), while personalized treatment is created by quantum approximate optimization algorithms (QAOAs). The system applies quantum Fourier transforms (QFTs) and Grover’s search algorithm to process efficiently. Experimental results in MIMIC-III, TCGA, and COVID-19 datasets confirm dominance by improving diagnostic correctness by 15% while computation time is decreased by 40% in genomic data processing compared to classical methods. Experimental results confirm that comparative evaluation establishes that conventional methods in deep learning have scalability limitations in efficiency and performance in intricate tasks in disease detection (such as cancer) and in tracking in real-time. This work bridges quantum computing with AI to lay the foundations for developing efficient, scalable, and intelligent healthcare systems to detect diseases earlier in time to reduce costs and improve patient outcomes.

关键词： Deep learning Support vector machines Quantum computing Accuracy Quantum algorithm Scalability Neural networks approximation algorithms Real-time systems Optimization

来源：评论

学校读者我要写书评

暂无评论

Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density

Sampling, Counting, and Large Deviations for Triangle-Free G...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Matthew Jenssen Will Perkins Aditya Potukuchi Michael Simkin Department of Mathematics King's College London London UK School of Computer Science Georgia Tech Atlanta USA Department of EECS York University Toronto Canada Department of Mathematics MIT Cambridge USA

ISBN: (数字)9798331516741

ISBN: (纸本)9798331516758

We study the following combinatorial counting and sampling problems: can we sample from the Erdős-Rényi random graph $G(n,p)$ conditioned on triangle-freeness? Can we approximate (either algorithmically or with a formula) the probability that $G(n,p)$ is triangle-free? These are prototypical instances of forbidden substructure problems ubiquitous in combinatorics. The algorithmic questions are instances of approximate sampling and counting for a hypergraph hard-core model. Estimating the probability that $G(n,p)$ has no triangles is a fundamental question in probabilistic combinatorics and one that has led to the development of many important tools in the field. Through the work of several authors, the asymnpotics of the logarithm of this probability are known if $p=o(n^{-1/2})$ or if $p=\omega(n^{-1/2})$ . The regime $p=\Theta(n^{-1/2})$ is more mysterious, as this range witnesses a dramatic change in the the typical structural properties of $G(n,p)$ conditioned on triangle-freeness. As we show, this change in structure has a profound impact on the performance of sampling algorithms. We give two different efficient sampling algorithms for this problem (and complementary approximate counting algorithms), one that is efficient when $p < c/\sqrt{n}$ and one that is efficient when $p > C/\sqrt{n}$ for constants $c, C > 0$ . The latter algorithm involves a new approach for dealing with large defects in the setting of sampling from low-temperature spin models. Our algorithmic results can be used to give an asymptotic formula for the logarithm of the probability $G(n,p)$ is triangle-free when $p < c/\sqrt{n}$ . This algorithmic approach to large deviation problems in random graphs is very different than the known approaches in the suBCRitical regime $p=o(n^{-1/2})$ (based on the Poisson paradigm) and in the supercritical regime $p=\omega(n^{-1/2})$ (based on regularity lemmas or hypergraph containers); in fact, to the b

关键词： Computer science Containers approximation algorithms Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Design of Power Grid Flexible Planning Algorithm Based on Deep Learning

Design of Power Grid Flexible Planning Algorithm Based on De...

引用

Electrical Drives, Power Electronics & Engineering (EDPEE), International Conference on

作者： Ya Zuo Xiangping Li Xiaojun Zhang Gang Chen Weidong Zheng State Grid Xinjiang Electric Power Co LTd Urumqi Xinjiang China State Grid Urumqi Electric Poer Supply Company Urumqi Xinjing China State Grid Xinjiang Economic Research Institute Urumqi Xinjiang China

ISBN: (数字)9798350395631

ISBN: (纸本)9798350395648

Conventional methods usually only consider one possible future environment, and cannot deal with the influence of various uncertain factors, so the obtained flexible planning scheme of power grid has poor adaptability to external environmental changes. This paper mainly discusses the flexible planning algorithm of power grid affected by uncertain factors. In this paper, the global optimization ability of GA(genetic algorithm) and the nonlinear approximation ability of BPNN(BP neural network) are combined for analysis and improvement, and an algorithm model of power grid flexible planning based on deep learning is established. It can not only reduce the search space of GA and improve the search efficiency, but also easily converge to the optimal solution, which provides a new strategy for solving the flexible power grid planning problem. It is found that the cost of the control group without considering the flexible balance of supply and demand is much higher than the total cost of this model, which shows the economic advantages of this model. The flexible cost of wind power and the flexible cost of load respectively represent that the lower the cost of waste air volume and load shedding, the better the wind power absorption capacity and the stronger the power supply reliability. The obtained planning scheme is more flexible and adaptable in the uncertain environment in the future.

关键词： Deep learning Costs Supply and demand Atmospheric modeling Wind power generation approximation algorithms Power grids

来源：评论

学校读者我要写书评

暂无评论

Efficient Approximate Range Aggregation over Large-scale Spatial Data Federation (Extended Abstract)

Efficient Approximate Range Aggregation over Large-scale Spa...

引用

38th IEEE International Conference on Data Engineering (ICDE)

作者： Shi, Yexuan Tong, Yongxin Zeng, Yuxiang Zhou, Zimu Ding, Bolin Chen, Lei Beihang Univ State Key Lab Software Dev Environm Beijing Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China Singapore Management Univ Sch Informat Syst Singapore Singapore

ISBN: (数字)9781665408837

ISBN: (纸本)9781665408837

Data federations notably increase the amount of data available for data-intensive applications such as smart mobility planning and public health emergency responses. Yet they also challenge the conventional implementation of range aggregation queries because the raw data cannot be shared within the federation and the data partition at each data silo is fixed during query processing. In this work, we propose the first-of-its-kind approximate algorithms for efficient range aggregation over spatial data federation. We devise novel singlesilo sampling algorithms that process queries in parallel and design a level sampling based algorithm which reduces the time complexity of local queries at each data silo to O(log 1 o), where o is the approximation ratio of the accuracy guarantee. Extensive experiments on real-world dataset validate the efficiency and effectiveness of the solutions.

关键词： Query processing Conferences approximation algorithms Data engineering Spatial databases Partitioning algorithms Planning

来源：评论

学校读者我要写书评

暂无评论

Flood Risk Assessment of Bihar State of India using Sentinel-1 on Google Earth Engine

Flood Risk Assessment of Bihar State of India using Sentinel...

引用

IEEE Students' Conference on Electrical, Electronics and Computer Science (SCEECS)

作者： Rajeev Ranjan Pandey Dhirendra Pratap Singh Jaytrilok Choudhary Nikhil Nigam Department of CSE Maulana Azad National Institute of Technology Bhopal India

ISBN: (数字)9798331529833

ISBN: (纸本)9798331529840

The devastating impact of floods could result in long-term economic consequences, property damage, mortality, and disruptions to essential services. Flood risk assessment is crucial to the solution of these problems because it provides valuable information about the potential frequency and magnitude of flooding episodes. Through a rigorous examination of variables such as geography, hydrology, land use, and climatic changes, flood risk assessment determines how susceptible populations and assets are to flooding. This method assists in locating areas that are vulnerable to flooding. With this information at hand, policymakers may improve catastrophe planning and response procedures, create informed plans for reducing the effects of floods, and allocate resources more effectively to reduce their effects. In the proposed method, the otsu and difference thresholding methods are being used to calculate the population affected by the flood. The model is 92.3% accurate in predicting the locations of the 12 affected districts. The resulting flood map may then be coupled with demographic statistics.

关键词： Earth Accuracy Sentinel-1 approximation algorithms Internet Sensors Satellite images Floods Risk management Engines

来源：评论

学校读者我要写书评

暂无评论

Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree

Reconsidering Tree based Methods for k-Maximum Inner-Product...

引用

International Conference on Data Engineering

作者： Hengzhao Ma Jianzhong Li Yong Zhang Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Existing literature on k-Maximum Inner-Product Search has made it a common belief that tree based methods are less effective in terms of index construction time and query performance compared to locality sensitive hashing based, similarity graph based and quantization based methods. However, in this paper we partially roll over the existing assessments about tree based k- Maximum Inner-Product Search methods by our newly proposed tree structure named LRUS-CoverTree. The experimental results show that the new k- Maximum Inner-Product Search algorithm based on LRUS-CoverTree outperforms the state-of-the-art locality sensitive hashing based methods, and achieves comparable performance with similarity graph based and quantization based methods in terms of query time and accuracy. What's more important, the desirable query performance is attained with significantly lower index construction time compared to all the other methods. Besides the experimental evaluations, substantial theoretical results about the LRUS-CoverTree and the new k-Maximum Inner-Product Search algorithm are provided, including construction time and search time complexity, size and height of the tree, and so on. Furthermore, several new effective upper bounds on the inner-product value are provided to support the efficient branch-and-bound algorithm on LRUS-CoverTree. In summary, our novel tree structure and new algorithm significantly improve upon existing tree based methods, and it is hoped that this contribution can lead to a reconsideration of tree based k-Maximum Inner-Product Search methods.

关键词： Quantization (signal) Upper bound Accuracy Vegetation approximation algorithms Search problems Data engineering

来源：评论

学校读者我要写书评

暂无评论

Near-Field FMCW SAR Imaging With Fast BPA

Near-Field FMCW SAR Imaging With Fast BPA

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhengguang Xu Xiaoxu Liu School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Conventional imaging algorithms, such as the Back Projection Algorithm (BPA) and the Range Migration Algorithm (RMA), have their own respective limitations in terms of computational complexity and efficiency. While BPA delivers high-resolution imaging, it demands significant computational resources. In contrast, RMA is more computationally efficient but sacrifices some precision. To address these challenges, a new near-field imaging algorithm called FastBPA is introduced. It builds on BPA and leverages the Fast Fourier Transform (FFT) for faster imaging, similar to RMA. A comparison of the computational complexities of RMA, BPA, and FastBPA shows that FastBPA reduces the time complexity of BPA imaging from Ο (N 2 L 2 ) to Ο (NLlog(NL)), making it equivalent to that of RMA. Experimental results from the 3DRIED dataset demonstrate that FastBPA matches BPA in focusing accuracy.

关键词： Image quality Fast Fourier transforms Signal processing algorithms Imaging Radar imaging approximation algorithms Radar signal processing Radar polarimetry Computational efficiency Time complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 444 445 446 447 448 449 450 451 452 453 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：