搜索资源列表
path_search
- 俄罗斯套娃游戏，给定一个输入矩阵，每个点权值不同，从起始点出发怎样走才能获得最大收益，每个点只能走到比当前点权值大的点，即能套住当前点，类似于俄罗斯套娃。-Russian Doll game, given an input matrix, each point with different weights, starting from the starting point for how to go to gain maximum benefit from every point only to
HMMall
- 马尔可夫过程是一类重要的随机过程,它的原始模型马尔可夫链,由俄国数学家Α.Α.马尔可夫于1907年提出。本程序是对隐马尔可夫模型的一个完整的建模。 -Markov process is one important class of stochastic processes, and its original model of Markov chain, by the Russian mathematician Markov Α.Α. made in 1907. This procedure is
ELSTEST_6_4
- 用C语言编写的俄罗斯方块程序,注释还算详细.-With the C language program of the Russian box, comments, fairly detailed.
Russian-farmer-multiplication
- 俄罗斯农夫算法，算法分析期末作业，作业要求不使用乘除法-Russian farmer algorithm does not use multiplication and division
14_Jyukovteager
- guess VADфa document containing information about the Teager energy operator. This document is in Russian please use the ladies and gentlemen, do not mention it.
SimilarityLYG
- /** * @作者：刘亚歌 * @日期时间：2012-5-24 下午06:45:47 * @描述：编辑距离的算法是首先由俄国科学家Levenshtein提出的，故又叫Levenshtein Distance。 */-/*** @ Author: Liu Ya Song* @ Date Time :2012-5-afternoon 24 06:45:47* @ descr iption: the edit distance algorithm is first p
brezenham
- Bresenham algorithm (realization was created by russian student)
Recognition
- This Qt 4.7/4.8 based app that recognising images at 3 ways. a) recognises is the line or circuit consists of black points at the image b) selecting areas of black points at image c) recognizing sharply contrasting contours at image. All
004..finally
- This is simple Qt-based application demonstrates a neural network adjusts to sinus function. The comments in code and letterings at app form written in RUSSIAN language.
Manual Qt-based tuning of neural function
- This is early (bun normally works) Qt 4.7/4.8-based application, released manual tuning of neural function. You can (and must :-) ) tuning numbers at first top table panel (weight of synapses) than has been coincided numbers in second and third table
sgu261
- sgu261：Discrete Roots(原根+离散对数+扩展欧几里得) 题目大意： 给你两个质数p,k，和整数a(0≤a<p)，求解所有满足x^k≡a(mod p)的x。-261. Discrete Roots time limit per test: 1 sec. memory limit per test: 65536 KB input: standard output: standard There are a lot of
math_problems
- Some math problems in russian.That can help in algorithms