搜索资源列表
GRAM
- 采用JAVA实现了GLOBUS toolkits中的GRAM客户端功能的一个小例子，是学习GT的好例子-using JAVA GLOBUS toolkits of the GRAM client function of a small example is the study GT good example!
gram
- 点集凸包Gram扫描法 c++程序-point set convex hull Gram scanning procedures c
CMU-Cam_Toolkit_v2.zip
- 自然语言处理和语音识别中必须的语言模型工具，这个工具可以生成文本或者二进制格式的N-gram表。配合HTK使用效果会更好。,natural language processing, speech recognition and language model must tools, this tool can generate text or binary format of the N-gram table. With the use of HTK results will be better.
Gram_Schmidt_Ortho.RAR
- Gram-Schmidt正交化在Matlab中的实现-Gram_Schmidt Orthogonality in Matlab
gramschimdi
- gram-schimdt-orthogonalization matlab pro
zernike
- zernike与patran得借口程序，编制机械软件patran的节点与matlab实现对口互接，用matlab复原分析元件，从而适合下一步数据处理即zernike波面拟合与数据分析-gram-schmidt and hosehouder algorithms, stability test procedures for the adoption of gram-schmidt algorithm hosehouder correctness of the algorithm is suitab
SPI_PGM
- dia gram for flasher en25t80
Class-based_n-gram_models_of_natural_language
- We address the problem of predicting a word from previous words in a sample of text. In particular, we discuss n-gram models based on classes of words. We also discuss several statistical algorithms for assigning words to classes based on the fre
Language_model_learning_in_English
- state of art language modeling methods: An Empirical Study of Smoothing Techniques for Language Modeling.pdf BLEU, a Method for Automatic Evaluation of Machine Translation.pdf Class-based n-gram models of natural language.pdf Distributed Lang
tft4137
- TFT4137液晶模块驱动。驱动芯片为S6D0139 (片内172800字节GRAM,即240*320*18/8-TFT4137 LCD driver module. Driver IC for S6D0139 (byte 172800-chip GRAM, that is, 240* 320* 18/8),
webcat
- 这是一个100 ％纯Java库，您可以使用适用于N元 分析技术的过程分为文本文件。 该计划包括几个不同的分类算法， namelly 支持向量机，贝叶斯Logistic回归，神经网络分类和文本压缩 算法。如支持向量机和贝叶斯Logistic回归，一个 “一对一” 用于多类分类。更详细的说明这些学习算法和可用的选项，请提供的javadocs 。-It is a 100 pure Java library that you can use to apply N-Gr
GSO
- 利用Gram-Schmidt正交化方法(GSO)对两个独立向量进行正交归一化,以及两个产生Laplace分布的程序-Gram-Schmidt
VC-6-Gram-Programing
- 虽然这本书有些简单，可是，它包含的内容其实也不少。 简单是因为我不想让它太复杂化，我尽量争取一个游戏程序，不到十面纸。事实也是如此：其中那么多的代码，有一半是详细的解释。 简单的另一个原因是，一个农民的儿子，我知道学生买一本大书的痛苦。 这本书不同于一般的书的地方在于：它是以游戏的实现为主线，附加一些程序涉及到的其它内容。 -VC++6 Gram Programing
3D-Gram-Programing
- 谁都想做3D游戏，但是谁都知道3D编程和2D编程是不同的。 做2D游戏只要有一个画点函数就什么都有了。变化很少，无非就是几个alpha混来混去的，就那么些东西，经过这么多年，早就被大家玩透了。 但是3D不同，它复杂，需要一大堆理论知识，点、线、面、向量、矩阵、材质、贴图、灯光…… 光这些术语就够让人一个头两个大了，更别说要用程序来表现这些东西。 但是现在想要做游戏，3D还真不能不学，我就正开始学3D编程。 "什么？你都才开始学3D就敢写文章骗钱了！"
segment
- 基于n元语法的分词。先训练后，再通过前后向最大匹配初步分词，在通过2元语法来消岐。-Based on the n-gram sub-word. The first training and then through to the maximum matching before and after the initial word, in through a 2-gram to eliminate qi.
Modi_Gram_S
- modified Gram-Schmidt (reduced QR factorization). A is a m-by-n matrix(m>=n)
Gram_S
- classical Gram-Schmidt(unstable) (reduced QR factorization).A:m-by-n matrix. (m>=n)Q:m-by-n unitary matrix.R:n-by-n upper triangular.-classical Gram-Schmidt(unstable) (reduced QR factorization).A:m-by-n matrix. (m>=n)Q:m-by-n unitary matrix.R:
grams
- Gram-Schmidt orthogonalization of the columns of A.
convex
- gram法求凸包， 凸包是区域内任意两点的直线不与边界相交的简单闭区域。 gram算法能够高效地求解出凸包的点集-gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve
N-gram
- N-gram中文分词系统,通过前后项切分,计算概率,进而获得最佳的切分-N-gram Chinese segment,by FMM and RMM,we can Calculate the probabilities,then,we can get the best segment.