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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,470 篇 会议
1,250 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

15,723 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,635 篇 工学
- 1,928 篇 计算机科学与技术...
- 1,700 篇 电气工程
- 703 篇 信息与通信工程
- 554 篇 控制科学与工程
- 539 篇 软件工程
- 286 篇 机械工程
- 232 篇 电子科学与技术（可...
- 231 篇 仪器科学与技术
- 46 篇 测绘科学与技术
- 38 篇 交通运输工程
- 30 篇 网络空间安全
- 19 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 13 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
371 篇 管理学
- 368 篇 管理科学与工程(可...
307 篇 理学
- 131 篇 系统科学
- 71 篇 数学
- 54 篇 物理学
- 27 篇 生物学
- 25 篇 地球物理学
- 11 篇 统计学（可授理学、...
82 篇 医学
- 75 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 教育学
- 9 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,723 篇 partitioning alg...
4,681 篇 clustering algor...
3,075 篇 algorithm design...
1,672 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
744 篇 hardware
735 篇 costs
734 篇 optimization
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
575 篇 approximation al...
573 篇 testing
559 篇 routing
504 篇 computer archite...
474 篇 concurrent compu...
459 篇 very large scale...
440 篇 application soft...

机构

40 篇 ibm thomas j. wa...
38 篇 department of co...
31 篇 school of comput...
25 篇 department of co...
22 篇 department of co...
20 篇 department of el...
18 篇 school of comput...
18 篇 department of co...
18 篇 department of el...
17 篇 department of co...
17 篇 school of electr...
17 篇 at and t bell la...
16 篇 school of comput...
16 篇 department of el...
16 篇 institute of com...
16 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of el...
15 篇 school of electr...

作者

25 篇 xianlong hong
19 篇 hichem frigui
15 篇 yici cai
14 篇 sanghamitra band...
13 篇 jun wang
13 篇 g. karypis
13 篇 li li
13 篇 jing wang
12 篇 sriparna saha
12 篇 tzung-pei hong
12 篇 a.k. jain
12 篇 thambipillai sri...
11 篇 suleyman s. koza...
11 篇 hau-san wong
11 篇 yu wang
11 篇 hui wang
11 篇 jian-jia chen
11 篇 p. banerjee
11 篇 sanjoy baruah
11 篇 francisco de a.t...

语言

15,585 篇 英文
106 篇 其他
32 篇 中文

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

共 15723 条记录，以下是4931-4940 订阅

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

详细简洁

排序：

SPIHT image compression with transmission of auxiliary information and selective modification of high frequency coefficients

SPIHT image compression with transmission of auxiliary infor...

引用

International Symposium on Intelligent Multimedia, Video and Speech Processing

作者： Li-minn Ang Hon Nin Cheung Division of Engineering University of Nottingham Kuala Lumpur Malaysia School of Computing and Information Technology University of Western Ontario Kingswood NSW Australia

ISBN: (纸本)0780386876

The SPIHT algorithm is a popular algorithm using wavelet techniques for image compression. In this paper, we present modifications to the algorithm by: 1) sending additional information to the decoder about the largest magnitudes in the frequency subbands; and 2) modifying selected coefficients in the high frequency subbands. The proposed modifications give an improvement to the algorithm performance without incurring much additional complexity.

关键词： Image coding Streaming media Decoding partitioning algorithms Image reconstruction Discrete wavelet transforms Tree data structures Frequency conversion Compression algorithms Image quality

来源：评论

学校读者我要写书评

暂无评论

Efficient search approaches for k-medoids-based algorithms

Efficient search approaches for k-medoids-based algorithms

引用

IEEE Region 10 International Conference TENCON

作者： Shu-Chuan Chu J.F. Roddick Tsong-Yi Chen Jeng-Shyang Pan School of Informatics and Engineering Flinders University of South Australia Australia Department of Electronic Engineering National Kaohsiung University of Applied Sciences Taiwan Department of Electrical and Electronic Engineering University of Adelaide Australia

In this paper, the concept of previous medoid index is introduced. The utilization of memory for efficient medoid search is also presented. We propose a hybrid search approach for the problem of nearest neighbor search. The hybrid search approach combines the previous medoid index, the utilization of memory, the criterion of triangular inequality elimination and the partial distance search. The proposed hybrid search approach is applied to the k-medoids-based algorithms. Experimental results based on Gauss-Markov source, curve data set and elliptic clusters demonstrate that the proposed algorithm applied to the CLARANS algorithm may reduce the number of distance calculations from 88.4% to 95.2% with the same average distance per object compared with CLARANS. The proposed hybrid search approach can also be applied to nearest neighbor searching and the other clustering algorithms.

关键词： Clustering algorithms partitioning algorithms Computational complexity Nearest neighbor searches Data mining Vector quantization Simulated annealing Iterative algorithms Informatics Gaussian processes

来源：评论

学校读者我要写书评

暂无评论

Research of an improved dense matching algorithm based on graph cuts

Research of an improved dense matching algorithm based on gr...

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Hongwei Gao Liang Chen Xiaoyang Liu Yang Yu School of Information Science & Engineering Shenyang Ligong University Shenyang China

According to the problem of graph cuts matching algorithm that lots of false matches appears in weak texture area, an improved graph cuts matching algorithm for dense matching is proposed in this paper. First, corner point detection and matching are made between stereo image pairs, and false matches are eliminated by relaxation algorithm and LMeds algorithm. Secondly, triangulate partitioning of discrete matching points is executed, the disparity of every triangle is control by its three vertex. Finally, the dense disparity mapping is draw by graph cuts based on energy function. The experimental results show performance of the proposed algorithm is improved and it will take a shorter time to compute an accuracy dense disparity mapping.

关键词： partitioning algorithms Computer vision Information science Computers Minimization methods Visualization Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Overlap versus partition: Marketing classification and customer profiling in complex networks of products

Overlap versus partition: Marketing classification and custo...

引用

International Conference on Data Engineering Workshops

作者： Diego Pennacchioli Michele Coscia Dino Pedreschi IMT - Lucca Lucca Italy CID - Harvard University Cambridge MA USA KDDLab University of Pisa Pisa Italy

In recent years we witnessed the explosion in the availability of data regarding human and customer behavior in the market. This data richness era has fostered the development of useful applications in understanding how markets and the minds of the customers work. In this paper we focus on the analysis of complex networks based on customer behavior. Complex network analysis has provided a new and wide toolbox for the classic data mining task of clustering. With community discovery, i.e. the detection of functional modules in complex networks, we are now able to group together customers and products using a variety of different criteria. The aim of this paper is to explore this new analytic degree of freedom. We are interested in providing a case study uncovering the meaning of different community discovery algorithms on a network of products connected together because co-purchased by the same customers. We focus our interest in the different interpretation of a partition approach, where each product belongs to a single community, against an overlapping approach, where each product can belong to multiple communities. We found that the former is useful to improve the marketing classification of products, while the latter is able to create a collection of different customer profiles.

关键词： Communities partitioning algorithms Clustering algorithms Complex networks Entropy Algorithm design and analysis Joining processes

来源：评论

学校读者我要写书评

暂无评论

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

A Constant Factor Approximation Algorithm for Unsplittable F...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Paul Bonsma Jens Schulz Andreas Wiese Computer Science Department Humboldt Universität zu Berlin Berlin Germany Institute of Mathematics Technische Universität Berlin Berlin Germany

In this paper, we present a constant-factor approximation algorithm for the unsplittable flow problem on a path. This improves on the previous best known approximation factor of O(log n). The approximation ratio of our algorithm is 7+e for any e>;0. In the unsplittable flow problem on a path, we are given a capacitated path P and n tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge e of P, the total demand of selected tasks that use e does not exceed the capacity of e. This is a well-studied problem that occurs naturally in various settings, and therefore it has been studied under alternative names, such as resource allocation, bandwidth allocation, resource constrained scheduling, temporal knapsack and interval packing. Polynomial time constant factor approximation algorithms for the problem were previously known only under the no-bottleneck assumption (in which the maximum task demand must be no greater than the minimum edge capacity). We introduce several novel algorithmic techniques, which might be of independent interest: a framework which reduces the problem to instances with a bounded range of capacities, and a new geometrically inspired dynamic program which solves a special case of the maximum weight independent set of rectangles problem to optimality. In addition, we show that the problem is strongly NP-hard even if all edge capacities are equal and all demands are either 1, 2, or 3.

关键词： Approximation algorithms Approximation methods Polynomials partitioning algorithms Heuristic algorithms Resource management Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A verification algorithm for logic circuits with internal variables

A verification algorithm for logic circuits with internal va...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： T. Nakaoka S. Wakabayashi T. Koide N. Yoshida Faculty of Engineering Hiroshima University Hiroshima Japan

In this paper, we present a formal verification method based on internal variables of a given circuit. In this method, the problem of deciding the logical equivalence of two logic circuits is transformed to the satisfiability problem, which is solved by constructing a set of BDDs, each of which is corresponding to an internal variable of the circuit. Experimental results showed the effectiveness of the proposed method.

关键词： Logic circuits Boolean functions Data structures Binary decision diagrams Input variables Formal verification Very large scale integration Telephony Circuit synthesis partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A public mesh watermarking algorithm based on addition property of Fourier transform

A public mesh watermarking algorithm based on addition prope...

引用

International Conference on Image and Graphics (ICIG)

作者： Li Li Zhigeng Pan David Zhang Hangzhou Dianzi University Hangzhou China State Key Laboratory of CAD&CG University of Zhejiang Hangzhou China Multimedia Signal Processing and Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

This paper presents a public mesh watermarking algorithm. First, the resultant watermarked image minus the original image is the watermark information. According to the addition property of the Fourier transform, a change of spatial domain will cause a change in the frequency domain. Then, the watermark information is scaled down and embedded in one part of the x-coordinate of the original mesh. Finally, the x-coordinate of the test mesh is amplified before extraction. Experimental results prove that our algorithm is resistant to a variety of attacks without the need for any preprocessing.

关键词： Watermarking Fourier transforms Signal processing algorithms Data mining Frequency domain analysis Wavelet domain partitioning algorithms Noise robustness Equations Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Performance Tuning of Steganography Algorithm for Privacy Preserving Association Rule Mining in Heterogeneous Data Base

Performance Tuning of Steganography Algorithm for Privacy Pr...

引用

New Technologies, Mobility and Security (NTMS)

作者： Mahmoud Hussein Ashraf El-Sisi Nabil Ismail Computer Science Department Faculty of computers and Information Menoufia University Shibin El Kom Egypt

Privacy and security issues in data mining become an important property in any data mining system. A considerable research has focused on developing new data mining algorithms that incorporate privacy constraints. In this paper, we focus on privately mining association rules in vertically partitioned data where the problem has been reduced to privately computing Boolean scalar products. We propose a modification of steganography-based multiparty protocols for this problem. The proposed modification fine tune the performance to be faster in case of very large database, with acceptable level of reduction in privacy.

关键词： Steganography Data privacy Association rules Data mining Distributed databases partitioning algorithms Cryptographic protocols Data security Information security Circuits

来源：评论

学校读者我要写书评

暂无评论

Unveiling the Power of Neural Program Synthesis in High Level Code Generation

Unveiling the Power of Neural Program Synthesis in High Leve...

引用

International Conference on Computing and Networking Technology (ICCNT)

作者： Gurram Kumar Sai Koganti Sri Sai Harshith Kucharlapati Akash Varma G. Yashwanth Kiran J Swaminathan Department of Computer Science and Engineering Amrita Vishwa Vidyapeetham Amritapuri India

ISBN: (数字)9798350370249

ISBN: (纸本)9798350370270

In this research, we delve into a transformative exploration of the realm of code generation, unveiling three fundamental modules that constitute the backbone of our study: the Text-to-Code Generation Model, Code Autocompletion Model, and the formidable Neural Program Synthesis Model. At the forefront of our investigation, we underscore the paramount importance of Neural Program Synthesis—a dynamic force adept at crafting custom programs from input-output examples. Our exploration delves into the intricate landscape of natural language-to-code generation, offering profound insights and invaluable contributions to the field. The ability to automatically generate code from natural language instructions holds immense significance in streamlining software development processes, reducing manual effort, and enhancing productivity. Furthermore, this research addresses a pressing need within the software engineering community for efficient methods of code generation, particularly in domains where human-program interaction is prevalent. Through rigorous experimentation and meticulous analysis, we shed light on methodologies and promising avenues for future research in this burgeoning domain, paving the way for advancements in automated software development and programming assistance tools.

关键词： Training Adaptation models Codes Recurrent neural networks Programming partitioning algorithms Python Testing Software development management Software engineering

来源：评论

学校读者我要写书评

暂无评论

Optimizing Mobile Computational Offloading with Delay Constraints

Optimizing Mobile Computational Offloading with Delay Constr...

引用

IEEE Global Communications Conference

作者： Yi-Hsuan Kao Bhaskar Krishnamachari Dept. of Electr. Eng. Univ. of Southern California Los Angeles CA USA

ISBN: (纸本)9781479935130

Computation Offloading, sending computational tasks to more resourceful servers, is becoming a widely-used approach to save limited resources on mobile devices like battery life, storage, processor, etc. Given an application that is partitioned into multiple tasks, the offloading decisions can be made on each of them. However, considering the delay constraint and the extra costs on data transmission and remote computation, it is not trivial to make optimized decisions. Existing works have formulated offloading decision problems as either graph-partitioning or binary integer programming problems. The first approach can solve the problem in polynomial time but is not applicable to delay constraints. The second approach relies on an integer programming solver without a polynomial time guarantee. We provide an algorithm, DTP (Deterministic delay constrained Task partitioning), to solve the offloading decision problem with delay constraints. DTP gives near-optimal solution and runs in polynomial time in the number of tasks. Going beyond prior work on linear delay constraints that apply only to serial tasks, we generalize the delay constraints to settings where the dependency between tasks can be described by a tree. Furthermore, we provide another algorithm, PTP (Probabilistic delay constrained Task partitioning), which gives stronger QoS guarantees. Simulation results show that our algorithms are accurate and robust, and scale well with the number of tasks.

关键词： integer programming mobile computing mobile handsets probability binary integer programming data transmission deterministic delay constrained task partitioning graph-partitioning integer programming solver linear delay constraints mobile computational offloading mobile devices offloading decisions probabilistic delay constrained task partitioning remote computation Delays Mobile communication Optimization partitioning algorithms Polynomials Quantization (signal) Radio frequency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 490 491 492 493 494 495 496 497 498 499 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：