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

probabilistic algorithm for finding roots of linearized polynomials

DESIGNS CODES AND CRYPTOGRAPHY 2008年第1期46卷 17-23页

作者： Skachek, Vitaly Roth, Ron M. Univ Coll Dublin Claude Shannon Inst Dublin 4 Ireland Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = Sigma(t)(i=0) L(i)x(qi) over F(q)n. The expected time complexity of the presented algorithm is O (nt) oper... 详细信息

关键词： linearized polynomials probabilistic algorithms root-finding algorithms symbolic GCD

来源：评论

学校读者我要写书评

暂无评论

probabilistic proximity search:: Fighting the curse of dimensionality in metric spaces

引用

INFORMATION PROCESSING LETTERS 2003年第1期85卷 39-46页

作者： Chávez, E Navarro, G Univ Chile Dept Comp Sci Santiago Chile Univ Michoacana Escuela Ciencias Fisicomatemat Morelia 58240 Michoacan Mexico

Proximity searches become very difficult on "high dimensional" metric spaces, that is, those whose histogram of distances has a large mean and/or a small variance. This so-called "curse of dimensionality", well known in vector spaces, is also observed in metric spaces. The search complexity grows sharply with the dimension and with the search radius. We present a general probabilistic framework applicable to any search algorithm and whose net effect is to reduce the search radius. The higher the dimension, the more effective the technique. We illustrate empirically its practical performance on a particular class of algorithms, where large improvements in the search time are obtained at the cost of a very small error probability. (C) 2002 Elsevier Science B.V All rights reserved.

关键词： metric spaces proximity searching nearest neighbor searching distance based indexing probabilistic algorithms approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

probabilistic models for melodic prediction

引用

ARTIFICIAL INTELLIGENCE 2009年第14期173卷 1266-1274页

作者： Paiement, Jean-Francois Bengio, Samy Eck, Douglas Idiap Res Inst CH-1920 Martigny Switzerland Google Mountain View CA 94043 USA Univ Montreal Dept Comp Sci & Operat Res Montreal PQ H3C 3J7 Canada

Chord progressions are the building blocks from which tonal music is constructed. The choice of a particular representation for chords has a strong impact on statistical modeling of the dependence between chord symbols and the actual sequences of notes in polyphonic music. Melodic prediction is used in this paper as a benchmark task to evaluate the quality of four chord representations using two probabilistic model architectures derived from Input/Output Hidden Markov Models (IOHMMs). Likelihoods and conditional and unconditional prediction error rates are used as complementary measures of the quality of each of the proposed chord representations. We observe empirically that different chord representations are optimal depending on the chosen evaluation metric. Also, representing chords only by their roots appears to be a good compromise in most of the reported experiments. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Music models Graphical models probabilistic algorithms Machine learning

来源：评论

学校读者我要写书评

暂无评论

On the probabilistic epipolar geometry

引用

IMAGE AND VISION COMPUTING 2008年第3期26卷 405-414页

作者： Brandt, Sami S. Helsinki Univ Technol Lab Computat Engn FI-02015 Helsinki Finland

In this paper, we are going to answer the following question: assuming that we have estimates for the epipolar geometry and its uncertainty between two views, how probable is it that a new, independent point pair will satisfy the true epipolar geometry and be, in this sense, a feasible candidate correspondence pair? If we knew the true fundamental matrix, the answer would be trivial but in reality we do not know it because of estimation errors. So, as an independent point in the first view is given, we will show we may compute the point-probability-density function, termed as the epipolar pdf, for the epipolar line points in the second view that describes the current level of knowledge of the epipolar geometry between the views. This point-point-probability-density relation is a probabilistic form of the epipolar constraint that also approaches the true point-line relation as the number of training correspondences tends to infinity. In this paper, we will also show that the eigenvectors of the epipolar line covariance matrix have certain interpretations on the image plane, of which one is the previously observed, narrowest point of the epipolar envelope. The results of this paper are important since the uncertainty of the epipolar constraint can be now taken into account in a sound way in applications. (c) 2006 Elsevier B.V. All rights reserved.

关键词： imaging geometry probabilistic algorithms stereo computer vision

来源：评论

学校读者我要写书评

暂无评论

probabilistic Marching Cubes

引用

COMPUTER GRAPHICS FORUM 2011年第3期30卷 931-940页

作者： Poethkow, Kai Weber, Britta Hege, Hans-Christian Zuse Inst Berlin ZIB Berlin Germany

In this paper we revisit the computation and visualization of equivalents to isocontours in uncertain scalar fields. We model uncertainty by discrete random fields and, in contrast to previous methods, also take arbitrary spatial correlations into account. Starting with joint distributions of the random variables associated to the sample locations, we compute level crossing probabilities for cells of the sample grid. This corresponds to computing the probabilities that the well-known symmetry-reduced marching cubes cases occur in random field realizations. For Gaussian random fields, only marginal density functions that correspond to the vertices of the considered cell need to be integrated. We compute the integrals for each cell in the sample grid using a Monte Carlo method. The probabilistic ansatz does not suffer from degenerate cases that usually require case distinctions and solutions of ill-conditioned problems. Applications in 2D and 3D, both to synthetic and real data from ensemble simulations in climate research, illustrate the influence of spatial correlations on the spatial distribution of uncertain isocontours.

关键词： I.3.3 [Computer Graphics]: Picture/Image Generation Viewing algorithms I.6.8 [Simulation and Modeling]: Types of Simulation Monte Carlo Visual G.3 [Mathematics of Computing]: Probability and Statistics probabilistic algorithms

来源：评论

学校读者我要写书评

暂无评论

Revisiting Deadlock Prevention: A probabilistic Approach

引用

NETWORKS 2014年第2期63卷 203-210页

作者： Oliveira, Fabiano de S. Barbosa, Valmir C. Univ Estado Rio de Janeiro Inst Matemat & Estat BR-20559900 Rio De Janeiro RJ Brazil Univ Fed Rio de Janeiro COPPE Programa Engn Sistemas & Computacao BR-21941972 Rio De Janeiro RJ Brazil

We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in terms of prohibiting the occurrence of directed cycles even in the most general of wait models (the so-called AND-OR model, in which prohibiting wait-for directed cycles is generally overly restrictive). For a particular case in which the priority digraphs are somewhat simplified, we introduce a Las Vegas probabilistic mechanism for resource granting and analyze its key aspects in detail. (c) 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(2), 203-210 2014

关键词： deadlock prevention priority digraphs probabilistic algorithms random graphs

来源：评论

学校读者我要写书评

暂无评论

probabilistic Static Load-Balancing of Parallel Mining of Frequent Sequences

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2016年第5期28卷 1299-1311页

作者： Kessl, Robert Czech Tech Univ Fac Informat Technol CR-16635 Prague Czech Republic

Frequent sequence mining is well known and well studied problem in datamining. The output of the algorithm is used in many other areas like bioinformatics, chemistry, and market basket analysis. Unfortunately, the frequent sequence mining is computationally quite expensive. In this paper, we present a novel parallel algorithm for mining of frequent sequences based on a static load-balancing. The static load-balancing is done by measuring the computational time using a probabilistic algorithm. For reasonable size of instance, the algorithms achieve speedups up to approximate to 3/4 . P where P is the number of processors. In the experimental evaluation, we show that our method performs significantly better then the current state-of-the-art methods. The presented approach is very universal: it can be used for static load-balancing of other pattern mining algorithms such as itemset/tree/graph mining algorithms.

关键词： Data mining frequent sequence mining parallel algorithms static load-balancing probabilistic algorithms

来源：评论

学校读者我要写书评

暂无评论

probabilistic Discovery of Semantically Diverse Content in MANETs

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2009年第4期8卷 544-557页

作者： Nedos, Andronikos Singh, Kulpreet Cunningham, Raymond Clarke, Siobhan Trinity Coll Dublin Sch Comp Sci & Stat Dept Comp Sci Distributed Syst Grp Dublin 2 Ireland

Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralized nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus among the nodes is kept to a minimum. This paper addresses an issue within the domain of semantic content discovery, namely, its current reliance on the preexisting agreement between the schema of content providers and consumers. We present OntoMobil, a semantic discovery model for ad hoc networks that removes the assumption of a globally known schema and allows nodes to publish information autonomously. The model relies on the randomized dissemination and replication of metadata through a gossip protocol. Given schemas with partial similarities, the randomized metadata dissemination mechanism facilitates eventual semantic agreement and provides a substrate for the scalable discovery of content. A discovery protocol can then utilize the replicated metadata to identify content within a predictable number of hops using semantic queries. A stochastic analysis of the gossip protocol presents the different trade-offs between discoverability and replication. We evaluate the proposed model by comparing OntoMobil against a broadcast-based protocol and demonstrate that semantic discovery with proactive replication provides good scalability properties, resulting in a high discovery ratio with less overhead than a reactive nonreplicated discovery approach.

关键词： Mobile ad hoc networks distributed discovery probabilistic algorithms gossip protocols semantic services

来源：评论

学校读者我要写书评

暂无评论

probabilistic quickest path algorithm

引用

THEORETICAL COMPUTER SCIENCE 2004年第2-3期312卷 189-201页

作者： Rao, NSV Oak Ridge Natl Lab Ctr Engn Syst Adv Res Div Math & Comp Sci Intelligent Syst Sect Oak Ridge TN 37831 USA

Due to the increasing role of quickest paths for on-demand routing in computer networks, it is important to compute them faster, perhaps, by trading-off the quality for computational speed. We consider the computation of a quickest path from a source node to a destination node for a given message size in a network with n nodes and m links each of which is specified by bandwidth and delay. Every known quickest path algorithm computes m shortest paths either directly or indirectly, and this step contributes to most of its computational complexity which is generally of the form O(m(2) + mn log n). We present a probabilistic quickest path algorithm that computes an approximate quickest path with time complexity O(pm + pn log n) by randomly selecting p less than or equal to m bandwidths at which the shortest paths are computed. We show that the delay of the computed path is close to optimal with a high probability that approaches 1 exponentially fast with respect to p/m. Simulation results indicate that this algorithm computes the optimal quickest paths with p/m < 0.1 for almost all randomly generated networks with n > 40. We also present an algorithm to compute the path-table consisting of these approximate quickest paths with the same time complexity of 0(pm + pn log n). (C) 2003 Elsevier B.V. All rights reserved.

关键词： quickest path probabilistic algorithms path-table approximate quickest path

来源：评论

学校读者我要写书评

暂无评论

RELIABILITY VERSUS COST - DESIGN OF A probabilistic BROADCAST ALGORITHM

引用

DISTRIBUTED COMPUTING 1994年第3期7卷 115-127页

作者： CIUFFOLETTI, A 1. Dipartimento di Informatica Università degli Studi di Pisa Corso Italia n. 40 I-56100 Pisa Italy

We propose a probabilistic algorithm to solve the problem of distributed broadcast. A simple diffusion algorithm is introduced, and its reliability is evaluated. The cost and reliability of the probabilistic algorithm... 详细信息

关键词： BROADCAST probabilistic algorithms RELIABILITY RANDOM DIFFUSION GEOMETRIC TOPOLOGY

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：