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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

169 篇 会议
50 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

141 篇 工学
- 113 篇 计算机科学与技术...
- 93 篇 软件工程
- 36 篇 生物医学工程（可授...
- 26 篇 生物工程
- 22 篇 光学工程
- 22 篇 建筑学
- 17 篇 土木工程
- 13 篇 信息与通信工程
- 11 篇 机械工程
- 8 篇 控制科学与工程
- 7 篇 电气工程
- 6 篇 仪器科学与技术
- 6 篇 电子科学与技术（可...
- 6 篇 测绘科学与技术
- 6 篇 交通运输工程
- 5 篇 力学（可授工学、理...
- 5 篇 化学工程与技术
- 3 篇 材料科学与工程（可...
121 篇 理学
- 81 篇 数学
- 28 篇 生物学
- 27 篇 物理学
- 9 篇 化学
- 5 篇 统计学（可授理学、...
19 篇 医学
- 18 篇 临床医学
- 17 篇 基础医学(可授医学...
- 16 篇 药学(可授医学、理...
18 篇 管理学
- 10 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
2 篇 教育学
2 篇 农学
1 篇 艺术学

主题

27 篇 visualization
18 篇 computer graphic...
11 篇 image segmentati...
9 篇 data visualizati...
8 篇 computed tomogra...
7 篇 optimization
6 篇 rendering (compu...
6 篇 magnetic resonan...
6 篇 generative adver...
6 篇 computation by a...
6 篇 algorithm analys...
6 篇 color
5 篇 cameras
5 篇 variable neighbo...
5 篇 volume rendering
5 篇 algorithm design...
5 篇 genetic algorith...
5 篇 image processing
5 篇 biomedical imagi...
5 篇 artificial intel...

机构

99 篇 institute of com...
26 篇 institute of com...
15 篇 computer algorit...
10 篇 vrvis research c...
10 篇 institute of com...
9 篇 partner site ess...
9 篇 department of in...
8 篇 university medic...
6 篇 university medic...
6 篇 institute of com...
6 篇 institute of com...
5 篇 institute of com...
5 篇 institute of com...
4 篇 department of st...
4 篇 tiani medgraph a...
4 篇 sap ag walldorf
4 篇 pattern recognit...
3 篇 christian michel...
3 篇 department of ra...
3 篇 department of or...

作者

33 篇 raidl günther r.
19 篇 egger jan
14 篇 wimmer michael
11 篇 hu bin
11 篇 viola ivan
11 篇 günther r. raidl
10 篇 li jianning
9 篇 pepe antonio
9 篇 gsaxner christin...
9 篇 bruckner stefan
9 篇 kleesiek jens
8 篇 m.e. groller
8 篇 klau gunnar w.
7 篇 purgathofer wern...
7 篇 ljubić ivana
7 篇 gröller m. eduar...
7 篇 leitner markus
6 篇 gröller e.
6 篇 weiskircher rené
5 篇 raidl günther

语言

225 篇 英文
3 篇 其他

检索条件"机构=Institute of Computer Graphics and Algorithms"

共 228 条记录，以下是31-40 订阅

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

详细简洁

排序：

Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification

Combining metaheuristics and exact algorithms in combinatori...

引用

First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005

作者： Puchinger, Jakob Raidl, Günther R. Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

In this survey we discuss different state-of-the-art approaches of combining exact algorithms and metaheuristics to solve combinatorial optimization problems. Some of these hybrids mainly aim at providing optimal solutions in shorter time, while others primarily focus on getting better heuristic solutions. The two main categories in which we divide the approaches are collaborative versus integrative combinations. We further classify the different techniques in a hierarchical way. Altogether, the surveyed work on combinations of exact algorithms and metaheuristics documents the usefulness and strong potential of this research direction. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Seamless texturing of archaeological data

Seamless texturing of archaeological data

引用

1st International Congress on Digital Heritage, DigitalHeritage 2013

作者： Birsak, Michael Musialski, Przemyslaw Arikan, Murat Wimmer, Michael Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)9781479931699

In this paper we propose a framework for out-of-core real-time rendering of high-quality textured archaeological data-sets. Our input is a triangle mesh and a set of calibrated and registered photographs. Our system performs the actual mapping of the photos to the mesh for high-quality reconstructions, which is a task referred to as the labeling problem. Another problem of such mappings are seams that arise on junctions between triangles that contain information from different photos. These are are approached with blending methods, referred to as leveling. We address both problems and introduce a novel labeling approach based on occlusion detection using depth maps that prevents texturing of parts of the model with images that do not contain the expected region. Moreover, we propose an improved approach for seam-leveling that penalizes too large values and helps to keep the resulting colors in a valid range. For highperformance visualization of the 3D models with a huge amount of textures, we make use of virtual texturing, and present an application that generates the needed texture atlas in significantly less time than existing scripts. Finally, we show how the mentioned components are integrated into a visualization application for digitized archaeological site. © 2013 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Letting ants labeling point features

Letting ants labeling point features

引用

2002 Congress on Evolutionary Computation, CEC 2002

作者： Schreyer, Michael Raidl, Günther R. Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)0780372824

This paper describes an ant colony system (ACS) for labeling point features. A pre-processing step reduces the search space in a safe way. The ACS applies local improvement and masking, a technique that focuses the optimization on critical regions. Empirical results indicate that the ACS reliably identifies high-quality solutions which are in many cases better than those of a state-of-the-art genetic algorithm for point-feature labeling. © 2002 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A branch-and-cut-and-price algorithm for a fingerprint-template compression application

A branch-and-cut-and-price algorithm for a fingerprint-templ...

引用

2011 Federated Conference on computer Science and Information Systems, FedCSIS 2011

作者： Chwatal, Andreas M. Thöni, Corinna Oberlechner, Karin Raidl, Günther R. Vienna University of Technology Institute of Computer Graphics and Algorithms 1040 Vienna Austria

ISBN: (纸本)9781457700415

In this work we present a branch-and-cut-and-price algorithm for the compression of fingerprint minutiae templates, in order to embed them into passport images by watermarking techniques as an additional security feature. For this purpose the minutiae data, which is a set of characteristic points of the fingerprint, is encoded by a spanning tree whose edges are encoded efficiently by a reference to an element in a dictionary (template arc) and a small correction vector. Our proposed branch-and-cut-and-price algorithm creates meaningful template arcs from a huge set of possible ones on demand in the pricing-procedure. Cutting-planes are separated in order to obtain connected subgraphs from which spanning trees can then be easily deduced. Our computational experiments confirm the superior performance of the algorithm in comparison to previous approaches for the spanning tree based encoding scheme. © 2011 Polish Info Processing Soc.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Label number maximization in the slider model: Extended abstract

引用

12th International Symposium on Graph Drawing, GD 2004

作者： Ebner, Dietmar Klau, Gunnar W. Weiskircher, René Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

ISBN: (纸本)9783540245285

We consider the NP-hard label number maximization problem LNM: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a largest subset of the labels. A labeling is a placement such that none of the labels overlap and each is placed so that its boundary touches the corresponding point feature. The purpose of this paper is twofold: We present a new force-based simulated annealing algorithm to heuristically solve the problem and we provide the results of a very thorough experimental comparison of the best known labeling methods on widely used benchmark sets. The design of our new method has been guided by the goal to produce labelings that are similar to the results of an experienced human performing the same task. So we are not only looking for a labeling where the number of labels placed is high but also where the distribution of the placed labels is good. Our experimental results show that the new algorithm outperforms the other methods in terms of quality while still being reasonably fast and confirm that the simulated annealing method is well-suited for map labeling problems. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Physically guided animation of trees

Physically guided animation of trees

引用

30th Annual Conference on European Association for computer graphics, EUROgraphics 2009

作者： Habel, Ralf Kusternig, Alexander Wimmer, Michael Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

This paper presents a new method to animate the interaction of a tree with wind both realistically and in real time. The main idea is to combine statistical observations with physical properties in two major parts of tree animation. First, the interaction of a single branch with the forces applied to it is approximated by a novel efficient two step nonlinear deformation method, allowing arbitrary continuous deformations and circumventing the need to segment a branch to model its deformation behavior. Second, the interaction of wind with the dynamic system representing a tree is statistically modeled. By precomputing the response function of branches to turbulent wind in frequency space, the motion of a branch can be synthesized efficiently by sampling a 2D motion texture. Using a hierarchical form of vertex displacement, both methods can be combined in a single vertex shader, fully leveraging the power of modern GPUs to realistically animate thousands of branches and ten thousands of leaves at practically no cost. © 2008 The Author(s).

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Structural alignment of two RNA sequences with Lagrangian relaxation

引用

15th International Symposium on algorithms and Computation, ISAAC 2004

作者： Bauer, Markus Klau, Gunnar W. Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

ISBN: (纸本)9783540241317

RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA molecules it is usually not sufficient to consider only the primary sequence, but it is important to consider both the sequence and the structure of the molecules. Traditional alignment algorithms can only account for the sequence of bases, but not for the base pairings. Considering the structure leads to significant computational problems because of the dependencies introduced by the base pairings and the presence of pseudoknots. In this paper we address the problem of optimally aligning two given RNA sequences either with or without known structure (allowing for pseudoknots). We phrase the problem as an integer linear program and then solve it using Lagrangian relaxation. In our computational experiments we could align large problem instances—18S and 23S ribosomal RNA with up to 1500 bases within minutes while preserving pseudoknots. © Springer-Verlag Berlin Heidelberg 2004.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

A layered particle-based fluid model for real-time rendering of water

A layered particle-based fluid model for real-time rendering...

引用

作者： Bagar, Florian Scherzer, Daniel Wimmer, Michael Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

We present a physically based real-time water simulation and rendering method that brings volumetric foam to the real-time domain, significantly increasing the realism of dynamic fluids. We do this by combining a particle-based fluid model that is capable of accounting for the formation of foam with a layered rendering approach that is able to account for the volumetric properties of water and foam. Foam formation is simulated through Weber number thresholding. For rendering, we approximate the resulting water and foam volumes by storing their respective boundary surfaces in depth maps. This allows us to calculate the attenuation of light rays that pass through these volumes very efficiently. We also introduce an adaptive curvature flow filter that produces consistent fluid surfaces from particles independent of the viewing distance. © 2010 The Eurographics Association and Blackwell Publishing Ltd.

关键词： Volumetric analysis

来源：评论

学校读者我要写书评

暂无评论

Accuracy Evaluation of Different Centerline Approximations of Blood Vessels

Accuracy Evaluation of Different Centerline Approximations o...

引用

6th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2004

作者： La Cruz, A. Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

ISBN: (纸本)390567307X

Accurate determination of the vessel axis is a prerequisite for automated visualization and quantification of artery diseases. This paper presents an evaluation of different methods for approximating the centerline of the vessel in a phantom simulating the peripheral arteries. Six algorithms were used to determine the centerline of a synthetic peripheral arterial vessel. They are based on: ray casting using thresholds and maximum gradient-like stop criterion, pixel motion estimation between successive images called block matching, center of gravity and shape based segmentation. The Randomized Hough Transform and ellipse fitting have been used as shape based segmentation techniques. Since in the synthetic data set the centerline is known, an estimation of the error can be calculated in order to determine the accuracy achieved by a given method. © The Eurographics Association 2004.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Smart Visibility in Visualization

Smart Visibility in Visualization

引用

1st Eurographics Workshop on Computational Aesthetics in graphics, Visualization, and Imaging, CAe 2005

作者： Viola, Ivan Gröller, Meister E. Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

ISBN: (纸本)3905673274

In this paper we discuss expressive visualization techniques that smartly uncover the most important information in order to maximize the visual information in the resulting images. This is achieved through dynamic changes in visual representations, through deformations, or through spatial modifications of parts of the data. Such techniques originate from technical illustration and are called cut-away views, ghosted views, and exploded views. These illustrative techniques unveil the most important visual information by employing high levels of abstraction. The change in visual representation or spatial position is done easily perceivable and the overall visual harmony is preserved. © The Eurographics Association 2005.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共23页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：