代码搜索：Probability
找到约 4,670 项符合「Probability」的源代码
代码结果 4,670
www.eeworm.com/read/205432/15316063
h hmm.h
#pragma once
// Author : Jinghui Xiao xiaojinghui@insun.hit.edu.cn, xceman@hotmail.com
// Organization : the natual language processing center of computer department of HIT
// Data : from 5 Sep
www.eeworm.com/read/171578/5393832
java mersennetwister.java
/*
** This code was modestly modified and completely reformatted, by Kent
** Paul Dolan, from published code. See accompanying file
** TravellerDoc.html for details, credits, and status of the
** mo
www.eeworm.com/read/162915/5512140
ref bpsk.ref
There were 39224 received bits in error.
There were 460776 correctly received bits.
The error probability was 0.078448
The theoretical error probability is 0.0786496
www.eeworm.com/read/160868/5565127
readme
Python-to-libsvm interface
Introduction
============
Python (http://www.python.org/) is a programming language suitable for
rapid development. This python-to-libsvm interface is developed so
users
www.eeworm.com/read/471592/6886025
1 consult.1
.EN
.TH C4.5 1
.SH NAME
.PP
consult \- classify items using a decision tree
.SH SYNOPSIS
.PP
.B consult
[ \fB-f\fR FNS ]
[ \fB-t\fR ]
.SH DESCRIPTION
.PP
.I Consult
reads a decision tree produced by c
www.eeworm.com/read/471592/6886028
1 consultr.1
.EN
.TH C4.5 1
.SH NAME
.PP
consultr \- classify items using a rule set
.SH SYNOPSIS
.PP
.B consultr
[ \fB-f\fR FNS ]
[ \fB-t\fR ]
.SH DESCRIPTION
.PP
.I Consultr
reads a rule set produced by c4.5rule
www.eeworm.com/read/471340/6890195
readme
Python-to-libsvm interface
Table of Contents
=================
- Introduction
- Installation
- Usage
- Examples
Introduction
============
Python (http://www.python.org/) is a programming language
www.eeworm.com/read/295408/8166622
readme
Python-to-libsvm interface
Introduction
============
Python (http://www.python.org/) is a programming language suitable for
rapid development. This python-to-libsvm interface is developed so
users
www.eeworm.com/read/171979/9727934
m hufflen.m
function HL = HuffLen(S)
% HuffLen Find the lengths of the Huffman code words
% Based on probability (or number of occurences) of each symbol
% the length for the Huffman codewords are calcula