虫虫首页|资源下载|资源专辑|精品软件
登录|注册

Computation

  • Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assum

    Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assuming BPSK. Brute force Monte Carlo approach is unsatisfactory (takes too long) to find the BER curve. The Computation uses a quasi-analytic (QA) technique that relies on the estimation (approximate one) of the information-bits Weight Enumerating Function (WEF) using A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.

    标签: convolutional Computes encoding decision

    上传时间: 2013-12-23

    上传用户:咔乐坞

  • # This resource site for "Grid Computing: Making the Global Infrastructure a Reality " edited by Fra

    # This resource site for "Grid Computing: Making the Global Infrastructure a Reality " edited by Fran Berman, Geoffrey Fox and Tony Hey. This is a book (over 1000 pages) published March 2003 by Wiley and (for those papers not published elsewhere) a special issue of Concurrency and Computation: Practice and Experience

    标签: Infrastructure Computing resource Reality

    上传时间: 2013-11-28

    上传用户:924484786

  • In this paper, we present LOADED, an algorithm for outlier detection in evolving data sets containi

    In this paper, we present LOADED, an algorithm for outlier detection in evolving data sets containing both continuous and categorical attributes. LOADED is a tunable algorithm, wherein one can trade off Computation for accuracy so that domain-specific response times are achieved. Experimental results show that LOADED provides very good detection and false positive rates, which are several times better than those of existing distance-based schemes.

    标签: algorithm detection containi evolving

    上传时间: 2014-01-07

    上传用户:aeiouetla

  • For developers using FPGAs for the implementation of floating-point DSP functions, one key challen

    For developers using FPGAs for the implementation of floating-point DSP functions, one key challenge is how to decompose the Computation algorithm into sequences of parallel hardware processes while efficiently managing data flow through the parallel pipelines of these processes.

    标签: floating-point implementation developers functions

    上传时间: 2013-12-16

    上传用户:tonyshao

  • The toolbox solves a variety of approximate modeling problems for linear static models. The model ca

    The toolbox solves a variety of approximate modeling problems for linear static models. The model can be parameterized in kernel, image, or input/output form and the approximation criterion, called misfit, is a weighted norm between the given data and data that is consistent with the model. There are three main classes of functions in the toolbox: transformation functions, misfit Computation functions, and approximation functions. The approximation functions derive an approximate model from data, the misfit Computation functions are used for validation and comparison of models, and the transformation functions are used for deriving one model representation from another. KEYWORDS: Total least squares, generalized total least squares, software implementation.

    标签: approximate The modeling problems

    上传时间: 2013-12-20

    上传用户:15071087253

  • 采用蚁群算法检测图像边缘 This a demo program of image edge detection using ant colony, based on the paper, "An

    采用蚁群算法检测图像边缘 This a demo program of image edge detection using ant colony, based on the paper, "An Ant Colony Optimization Algorithm For Image Edge Detection," IEEE Congress on Evolutionary Computation (CEC), pp. 751-756, Hongkong, Jun. 2008.

    标签: detection program colony based

    上传时间: 2016-09-28

    上传用户:cc1

  • THE DESIGN PATTERNS JAVA COMPANION 1. Creational Patterns 17 The Factory Pattern 18 How a Facto

    THE DESIGN PATTERNS JAVA COMPANION 1. Creational Patterns 17 The Factory Pattern 18 How a Factory Works 18 Sample Code 18 The Two Derived Classes 19 Building the Factory 20 Factory Patterns in Math Computation 22 When to Use a Factory Pattern 24 Thought Questions 25 The Abstract Factory Pattern 26 A GardenMaker Factory 26 How the User Interface Works 28 Consequences of Abstract Factory 30 Thought Questions 30 The Singleton Pattern 31 Throwing the Exception 32 Creating an Instance of the Class 32 Static Classes as Singleton Patterns 33 Creating Singleton Using a Static Method 34

    标签: Creational COMPANION PATTERNS Patterns

    上传时间: 2013-12-20

    上传用户:xwd2010

  • 特殊函数的fortran代码

    特殊函数的fortran代码,是书Computation of Special Functions所附源码,将源码放入自己的代码即可

    标签: fortran 函数 代码

    上传时间: 2016-10-09

    上传用户:thinode

  • 15篇光流配准经典文献

    15篇光流配准经典文献,目录如下: 1、A Local Approach for Robust Optical Flow Estimation under Varying 2、A New Method for Computing Optical Flow 3、Accuracy vs. Efficiency Trade-offs in Optical Flow Algorithms 4、all about direct methods 5、An Introduction to OpenCV and Optical Flow 6、Bayesian Real-time Optical Flow 7、Color Optical Flow 8、Computation of Smooth Optical Flow in a Feedback Connected Analog Network 9、Computing optical flow with physical models of brightness Variation 10、Dense estimation and object-based segmentation of the optical flow with robust techniques 11、Example Goal Standard methods Our solution Optical flow under 12、Exploiting Discontinuities in Optical Flow 13、Optical flow for Validating Medical Image Registration 14、Tutorial Computing 2D and 3D Optical Flow.pdf 15、The Computation of optical flow

    标签: 光流

    上传时间: 2014-11-21

    上传用户:fanboynet

  • 密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data struct

    密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary precision floating point arithmetic. NTL provides high quality implementations of state-of-the-art algorithms for: * arbitrary length integer arithmetic and arbitrary precision floating point arithmetic * polynomial arithmetic over the integers and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, Computation of minimal polynomials, traces, norms, and more * lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev * basic linear algebra over the integers, finite fields, and arbitrary precision floating point numbers.

    标签: high-performance providing portable library

    上传时间: 2014-01-04

    上传用户:exxxds