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

14th Annual Neural Information Processing Systems Conference, NIPS 2000

作者： Frey, Brendan J. Kannan, Anitha Intelligent Algorithms Lab. University of Toronto Canada

ISBN: (纸本)0262122413

One way to approximate inference in richly-connected graphical models is to apply the sum-product algorithm (a.k.a. probability propagation algorithm), while ignoring the fact that the graph has cycles. The sum-product algorithm can be directly applied in Gaussian networks and in graphs for coding, but for many conditional probability functions - including the sigmoid function - direct application of the sum-product algorithm is not possible. We introduce "accumulator networks" that have low local complexity (but exponential global complexity) so the sum-product algorithm can be directly applied. In an accumulator network, the probability of a child given its parents is computed by accumulating the inputs from the parents in a Markov chain or more generally a tree. After giving expressions for inference and learning in accumulator networks, we give results on the "bars problem" and on the problem of extracting translated, overlapping faces from an image.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Geometric spanners merging and its applications 28

Geometric spanners merging and its applications

引用

28th Canadian Conference on Computational Geometry, CCCG 2016

作者： Bakhshesh, Davood Farshi, Mohammad Combinatorial and Geometric Algorithms Lab. Department of Computer Science Yazd University Yazd Iran

Let G1 = (P1, E1) and G2 = (P2, E2) with P1 ∩ P2 = ∅ be two t-spanners (t > 1) in the plane. One interesting question is that how one can merge these two t-spanners to make a t-spanner on P1 ∪ P2 by only adding some edges between G1 and G2. In this paper, we propose an algorithm to merge G1 and G2 in O(n1 log n1 + (n1 + n2) log n2) time, where n1 = |P1|, n2 = |P2| and without loss of generality we assume that n1 ≤ n2. Furthermore, using the proposed algorithm, we present some divide and conquer algorithms to construct a t-spanner and a fault-tolerant t-spanner for a given point set in the plane. © Canadian Conference on Computational Geometry, CCCG *** right reserved.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Visualization of geometric spanner algorithms 32

Visualization of geometric spanner algorithms

引用

32nd International Symposium on Computational Geometry, SoCG 2016

作者： Farshi, Mohammad Hosseini, Seyed Hossein Combinatorial and Geometric Algorithms Lab. Department of Computer Science Yazd University Yazd Iran

ISBN: (纸本)9783959770095

It is easier to understand an algorithm when it can be seen in interactive mode. The current study implemented four algorithms to construct geometric spanners;the path-greedy, gap-greedy, Θ-graph and Yao-graph algorithms. The data structure visualization framework (http://***/~galles/visualization/) developed by David Galles was used. Two features were added to allow its use in spanner algorithm visualization: support point-based algorithms and export of the output to Ipe drawing software format. The interactive animations in the framework make steps of visualization beautiful and media controls are availab.e to manage the animations. Visualization does not require extensions to be installed on the web browser. It is availab.e at http://***/cgalg/AlgsVis/. © Mohammad Farshi and Seyed Hossein Hosseini.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Distributed evaluation of functional BSP programs

引用

Parallel Processing Letters 2001年第4期11卷 423-437页

作者： Loulergue, F. Lab. of Algorithms Complexity/Logic University of Paris 12 61 ave. du General de Gaulle F-94010 Créteil Cedex France

The BSλp-calculus is a calculus of functional bulk synchronous parallel (BSP) programs. It is the basis for the design of a bulk synchronous parallel ML language. For data-parallel languages, there are two points of view: the programming model where a program is seen as a sequence of operations on parallel vectors, and the execution model where the program is a parallel composition of programs run on each processor of the parallel machine. BSP algorithms are defined by data-parallel algorithms with explicit (physical) processes in order to allow their parallel execution time to be estimated. We present here a distributed evaluation minimally synchronous for BSP execution (which corresponds to the execution model). This distributed evaluation is correct w.r.t. the call-by-value strategy of the BSλp-calculus (which corresponds to the programming model).

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A Case Study in Object Oriented Modeling, Architecting, and Designing an Enterprise Monitoring Application

A Case Study in Object Oriented Modeling, Architecting, and ...

引用

Proceedings of the International Conference on Software Engineering Research and Practise. SERP 2003

作者： Louis, Sushil J. McDonnell, John Hohmeyer, Doan Heinselman, Lisa Walker, Andrew Genetic Algorithms Systems Lab. University Of Nevada Reno SPAWAR Systems Center San Diego CA

ISBN: (纸本)193241519X

We describe the use of object oriented techniques for the specification, architecting, and design of an enterprise monitoring application. Monitoring applications provide situational awareness and monitor aspects of an enterprise's activities. Drawing from a wide variety of static and dynamic data sources, they typically allow a user to specify items of interest, and drill down to obtain real-time or near-real time information on such items. Our paper describes the use of standard UML for modeling and the issues in architecting and designing our J2EE framework based application.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

On structures and behaviors of spiking neural P systems and Petri nets

On structures and behaviors of spiking neural P systems and ...

引用

13th International Conference on Membrane Computing, CMC 2012

作者： Cabarle, Francis George C. Adorna, Henry N. Algorithms and Complexity Lab. Department of Computer Science University of the Philippines Diliman Diliman 1101 Quezon City Philippines

ISBN: (纸本)9783642367502

In this work we investigate further the relationship between Petri nets and Spiking Neural P (SNP) systems: we consider SNP systems that have source (no incoming synapse) and sink (no outgoing synapse) neurons, and the initial configuration of the system is where only the source neuron has only one spike. We then route the initial single spike through the system to the sink neuron, using routing constructs. This type of SNP systems are similar to Petri nets, in particular to Workflow (WF) nets. We observe structural and behavioral properties of these nets for routing a single token can be simulated by SNP systems with source and sink neurons. Certain routing types such as AND-splits and OR-joins are 'natural' in SNP systems, but AND-joins and especially OR-splits seem to be more complex. Our results also suggest the possibility of analysing workflows using SNP systems. © 2013 Springer-Verlag.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Sequentially fitting "inclusive" trees for inference in noisy-OR networks

Sequentially fitting "inclusive" trees for inference in nois...

引用

14th Annual Neural Information Processing Systems Conference, NIPS 2000

作者： Frey, Brendan J. Patrascu, Relu Jaakkola, Tommi S. Moran, Jodi Intelligent Algorithms Lab. University of Toronto Canada Computer Science and Electrical Engineering Massachusetts Institute of Technology United States

ISBN: (纸本)0262122413

An important class of problems can be cast as inference in noisy-OR Bayesian networks, where the binary state of each variable is a logical OR of noisy versions of the states of the variable's parents. For example, in medical diagnosis, the presence of a symptom can be expressed as a noisy-OR of the diseases that may cause the symptom - on some occasions, a disease may fail to activate the symptom. Inference in richly-connected noisy-OR networks is intractable, but approximate methods (e.g., variational techniques) are showing increasing promise as practical solutions. One problem with most approximations is that they tend to concentrate on a relatively small number of modes in the true posterior, ignoring other plausible configurations of the hidden variables. We introduce a new sequential variational method for bipartite noisy-OR networks, that favors including all modes of the true posterior and models the posterior distribution as a tree. We compare this method with other approximations using an ensemble of networks with network statistics that are comparable to the QMR-DT medical diagnostic network.

关键词： Variational techniques

来源：评论

学校读者我要写书评

暂无评论

Practical spectral photography

Practical spectral photography

引用

33rd Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2012

作者： Habel, Ralf Kudenov, Michael Wimmer, Michael Institute of Computer Graphics and Algorithms Vienna University of Technology Austria Optical Detection Lab. University of Arizona United States

We introduce a low-cost and compact spectral imaging camera design based on unmodified consumer cameras and a custom camera objective. The device can be used in a high-resolution configuration that measures the spectrum of a column of an imaged scene with up to 0.8 nm spectral resolution, rivalling commercial non-imaging spectrometers, and a mid-resolution hyperspectral mode that allows the spectral measurement of a whole image, with up to 5 nm spectral resolution and 120×120 spatial resolution. We develop the necessary calibration methods based on halogen/fluorescent lamps and laser pointers to acquire all necessary information about the optical system. We also derive the mathematical methods to interpret and reconstruct spectra directly from the Bayer array images of a standard RGGB camera. This objective design introduces accurate spectral remote sensing to computational photography, with numerous applications in color theory, colorimetry, vision and rendering, making the acquisition of a spectral image as simple as taking a high-dynamic-range image. © 2012 The Author(s).

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Feature peeling 07

Feature peeling

引用

Graphics Interface 2007

作者： Malik, Muhammad Muddassir Möller, Torsten Gröller, M. Eduard Institute of Computer Graphics and Algorithms Vienna University of Technology Austria Lab. Computing Science Department Simon Fraser University Canada

ISBN: (纸本)1568813376

We present a novel rendering algorithm that analyses the ray profiles along the line of sight. The profiles are subdivided according to encountered peaks and valleys at so called transition points. The sensitivity of these transition points is calibrated via two thresholds. The slope threshold is based on the magnitude of a peak following a valley, while the peeling threshold measures the depth of the transition point relative to the neighboring rays. This technique separates the dataset into a number of feature layers. The user can scroll through the layers inspecting various features from the current view position. While our technique has been inspired by opacity peeling approach, we demonstrate that we can reveal detectable features even in the third and forth layers for both CT and MRI datasets.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Architectural style classification of building facade windows

Architectural style classification of building facade window...

引用

7th International Symposium on Visual Computing, ISVC 2011

作者： Shalunts, Gayane Haxhimusa, Yll Sablatnig, Robert Institute of Computer Aided Automation Computer Vision Lab. Vienna University of Technology Austria Institute of Computer Graphics and Algorithms Pattern Recongition and Image Processing Lab. Vienna University of Technology Austria

Building facade classification by architectural styles allows categorization of large databases of building images into semantic categories belonging to certain historic periods, regions and cultural influences. Image databases sorted by architectural styles permit effective and fast image search for the purposes of content-based image retrieval, 3D reconstruction, 3D city-modeling, virtual tourism and indexing of cultural heritage buildings. Building facade classification is viewed as a task of classifying separate architectural structural elements, like windows, domes, towers, columns, etc, as every architectural style applies certain rules and characteristic forms for the design and construction of the structural parts mentioned. In the context of building facade architectural style classification the current paper objective is to classify the architectural style of facade windows. Typical windows belonging to Romanesque, Gothic and Renaissance/Baroque European main architectural periods are classified. The approach is based on clustering and learning of local features, applying intelligence that architects use to classify windows of the mentioned architectural styles in the training stage. © 2011 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：