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

A polynomial-time algorithm for near-perfect phylogeny 23rd

23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996

作者： Fernández-Baca, David Lagergren, Jens Department of Computer Science Iowa State University AmesIA50011 United States Department of Numerical Analysis and Computing Science Royal Institute of Technology StockholmS-100 44 Sweden

We define a parameterized version of the Steiner tree problem in phylogeny where the parameter measures the amount by which a phylogeny differs from "perfection." This problem is shown to be solvable in poly... 详细信息

ISBN: (纸本)3540614400

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Seeing the obvious [robot vision]

Seeing the obvious [robot vision]

引用

13th International Conference on Pattern Recognition, ICPR 1996

作者： Bräutigam, Carsten G. Garding, Jonas Eklundh, Jan-Olof Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm Sweden DeeMed International Centre Equation 2 AV de Vignate F-3861O Gières France

ISBN: (纸本)081867282X

We propose an approach to determine the occurrence of low-parametric qualitative models from images by a hypothesis-and-test approach based on the coincidence of multiple cues, thereby avoiding complete reconstruction of the scene. A system is presented which applies the approach to finding instances of planar surfaces, as it is important in many tasks for mobile or manipulating robots. The system uses monocularly determined L-junctions and binocular disparities. A notable feature of the approach is that it finds the most conspicuous exemplar of the model first. This property seems quite relevant for an agent using vision to guide its behaviors, since the simplest solution becomes available early on. © 1996 IEEE.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

Seeing the obvious [robot vision]

Seeing the obvious [robot vision]

引用

International Conference on Pattern Recognition

作者： C.G. Brautigam J. Garding J.-O. Eklundh Computational Vision and Active Perception Laboratory Department of Numerical Analysis and Computing Science Royal Institute of Technology Stockholm Sweden

关键词： Layout Image reconstruction Surface reconstruction Testing Cameras Computer vision Mobile robots Laboratories numerical analysis Data mining

来源：评论

学校读者我要写书评

暂无评论

Some problems in active vision

Some problems in active vision

引用

Workshop on Cybernetic Vision

作者： J.-O. Eklundh P. Nordlund T. Uhlin Computational Vision and Active Perception Laboratory Department of Numerical Analysis and Computing Science Royal Institute of Technology Stockholm Sweden

We stress a systems approach for research in active vision. We also argue that design and analysis of seeing agents should be accompanied by experiments, requiring implementations, i.e. a constructive approach. In par... 详细信息

关键词： Computer vision Robot vision systems MONOS devices Cognitive robotics Artificial intelligence Cognitive science Biological system modeling Laboratories numerical analysis Stress

来源：评论

学校读者我要写书评

暂无评论

A computational model of depth-based attention

A computational model of depth-based attention

引用

International Conference on Pattern Recognition

作者： A. Maki P. Nordlund J.-O. Eklundh TOSHIBA Kansai Research Laboratory Royal Institute of Technology Motoyama Japan Computational Vision and Active Perception Laboratory (CVAP) Department of Numerical Analysis and Computing Science Royal Institute of Technology Stockholm Sweden

We present a computational model for attention. It consists of an early parallel stage with preattentive cues followed by a later serial stage, where the cues are integrated. We base the model on disparity image flow and motion. As one of the several possibilities we choose a depth-based criterion to integrate these cues, in such a way that the attention is maintained to the closest moving object. We demonstrate the technique by experiments in which a moving observer selectively mask our different moving objects in real scenes.

关键词： Computational modeling Computer vision Layout Phase estimation Laboratories numerical analysis Psychology Humans Computational efficiency Stability

来源：评论

学校读者我要写书评

暂无评论

Portability, predictability and performance for parallel computing: BSP in practice

引用

Concurrency and Computation: Practice and Experience 1996年第10期8卷

作者： Joy Reed Kevin Parrott Tim Lanfear Department of Computing Science Oxford Brookes University UK Numerical Analysis Group Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD UK Sowerby Research Centre BAe (Operations) Ltd. UK

We report on practical experience using the Oxford BSP Library to parallelize a large electromagnetic code, the British Aerospace finite-difference time-domain code EMMA T:FD3D. The Oxford BS Library is one of the first realizations of the Bulk Synchronous Parallel computational model to be targeted at numerically intensive scientific (typically Fortran) computing. The BAe EMMA code is one of the first large-scale applications to be parallelized using this library, and it is an important demonstration of the cost effectiveness of the BSP approach. We illustrate how BSP cost-modelling techniques can be used to predict and optimize performance for single-source programs across different parallel platforms. We provide predicted and observed performance figures for an industrial-strength, single-source parallel code for a variety of real parallel architectures: shared memory multiprocessors, workstation clusters and massively parallel platforms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LOW SPIKING RATES IN A POPULATION OF MUTUALLY EXCITING PYRAMIDAL CELLS (VOL 6, PG 271, 1995)

引用

NETWORK-COMPUTATION IN NEURAL SYSTEMS 1995年第3期6卷 511-511页

作者： FRANSEN, E LANSNER, A SANS — Studies of Artificial Neural Systems Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm Sweden

In a recurrent artificial neural network, the units active in an attractor state typically reach their maximum activity value while the others are quiescent. In contrast, recordings of cortical cell activity in vivo rarely reveal cells firing at their maximum rate. This discrepancy has been one of the main arguments against using attractor networks as models of cortical associative memory. In this study we show that low-rate sustained after-activity can be obtained in a simulated network of mutually exciting pyramidal cells. This is achieved by assuming that the synapses in the network are of a saturating type. When the application of a monoamine neuromodulator is simulated, after-activity with firing rates around 60?s^?1 can be produced. The firing pattern of the network was found to be similar to that of the experimentally most comparable system, the disinhibited hippocampal slice. The results obtained are robust against simulated biological variation and background noise.

关键词： Primate temporal cortex Computer-based model Neural networks Visual-cortex Realistic simulations Neuronal correlate Dendritic spines Cortical-neurons Firing rates Term-memory FIRING RATE Attractor Neural network Computer based modeling cell activity ignition sequence Network Dendritic Spines realistic simulation Visual Cortex

来源：评论

学校读者我要写书评

暂无评论

Closing the loop: Pursuing a moving object by a moving observer 6th

引用

6th International Conference on Computer analysis of Images and Patterns, CAIP 1995

作者： Nordlund, Peter Uhlin, Tomas Department of Numerical Analysis Computing Science Royal Institute of Technology StockholmS-10044 Sweden

ISBN: (纸本)3540602682

We present an integrated system, able to pursue a moving object by controlling a robot-head to maintain the moving object centered in the image. This system runs continuously in time and updates the object localization at a frame-rate of 25 Hz. The moving object can be tracked although the observer performs an unknown independent motion, involving both translation and rotation. We focus on a simple algorithm, since computational cost is of major importance for real-time systems with feedback. The algorithm is noniterative and computationally cheap. The running time complexity is O(n) for an image containing n pixels. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Strong lower bounds on the approximability of some NPO PB-complete maximization problems 20th

Strong lower bounds on the approximability of some NPO PB-co...

引用

20th International Symposium on Mathematical Foundations of Computer science, MFCS 1995

作者： Kann, Viggo Department of Numerical Analysis and Computing Science Royal Institute of Technology StockholmS-100 44 Sweden

ISBN: (纸本)3540602461

The approximability of several NP maximization problems is investigated and strong lower bounds for the studied problems are proved. For some of the problems the bounds are the best that can be achieved, unless P = NP. For example we investigate the approximabflity of MAX PB 0 - 1 PROGRA1VIMING, the problem of finding a binary vector x that satisfies a set of linear relations such that the objective value ∑cixi is maximized, where cl are binary numbers. We show that, unless P = NP, MAX PB 0 - 1 PROGRAMMING is not approximable within the factor n1-Ε for any Ε > 0, where n is the number of inequalities, and is not approximable within m1/2-Ε for amy Ε > 0, where m is the number of variables. Similar hardness results are shown for other problems on binary linear systems, some problems on the satisfiability of boolean formulas and the longest induced circuit problem. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Direct obstacle detection and motion from spatio-temporal derivatives 6th

引用

6th International Conference on Computer analysis of Images and Patterns, CAIP 1995

作者： Fornland, Päir Department of Numerical Analysis and Computing Science Royal Institute of Technology StockholmS-100 44 Sweden

ISBN: (纸本)3540602682

Autonomous vehicles need a means of detecting obstructions on its path, to avoid collision. In this paper, a novel approach to obstacle detection is presented. A camera moves on a visible ground plane with the optical axis parallel to the ground. Camera motion parameters are hnearly related to first order spatio-temporal derivatives of the taken image sequence;image flow is not needed. Motion is robustly estimated using RANSAC. An error measure for each image point corresponds to the likelihood of an obstacle in that point. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：