nearest

Roaming Swiss bus users get mobile phone guide

camera reads a barcode on hiking signposts, which opens a webpage with the exact timetable for the nearest
·2015-10-31 12:53

Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-31 12:00

【20090704-01】空间插值方法汇总

Kriging（克里金插值法） Minimum Curvature（最小曲率） Modified Shepard's Method（改进谢别德法） Natural Neighbor（自然邻点插值法） Nearest
·2015-10-31 11:53

【leetcode刷题笔记】Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-31 11:26

math.random用法

Math.random():获取0~1随机数Math.floor() method rounds a number DOWNWARDS to the nearest integer, and returns
·2015-10-31 11:28

leetcode[111]Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-31 10:02

几种Rounding的区别【wiki】

y round down (towards −∞) round up (towards +∞) round towards zero round away from zero round to nearest
·2015-10-31 10:24

NeHe_Lesson7 纹理过滤，灯光

            GL_NEAREST过滤  (与linear 过滤方式相比速度较快效果较差
·2015-10-31 09:33

LeetCode - Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-31 09:17

Poj1330Nearest Common Ancestors LCA

题意给一颗树，再给一个查询两点之间的最近公共祖先。 #include<iostream> #include<cstdio> #include<cstring> #include<map> #include<vector> using namespace std; const int maxn = 111111; st
·2015-10-31 09:17

kNN(K-Nearest Neighbor)最邻近规则分类

KNN最邻近规则，主要应用领域是对未知事物的识别，即推断未知事物属于哪一类，推断思想是，基于欧几里得定理，推断未知事物的特征和哪一类已知事物的的特征最接近； K近期邻(k-Nearest Neighbor
·2015-10-31 09:48

POJ 1330 Nearest Common Ancestors (Tarjan & LCA)

Nearest Common Ancestors Time Limit: 1000MS   Memory Limit: 10000K Total Submissions
·2015-10-31 08:54

poj1330Nearest Common Ancestors 1470 Closest Common Ancestors（LCA算法）

LCA思想：http://www.cnblogs.com/hujunzheng/p/3945885.html 在求解最近公共祖先为问题上，用到的是Tarjan的思想，从根结点开始形成一棵深搜树，非常好的处理技巧就是在回溯到结点u的时候，u的子树已经遍历，这时候才把u结点放入合并集合中，这样u结点和所有u的子树中的结点的最近公共祖先就是u了，u和还未遍历的所有u的兄弟结点及子树中的最近公共祖先就是
·2015-10-31 08:30

几种常见模式识别算法整理和总结

K-Nearest Neighbor K-NN能够说是一种最直接的用来
·2015-10-31 08:44

LeetCode: Minimum Depth of Binary Tree 题解

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-30 14:00

Careercup - Google面试题 - 6331648220069888

2014-05-08 22:27 题目链接 原题： What's the tracking algorithm of nearest location to some friends that
·2015-10-30 13:07

OpenCV学习笔记：opencv_ml模块

CvStatModel ; class CvMLData; struct CvParamGrid; 1，bayesian,Normal Bayes Classifier（贝叶斯分类）； 2，K-Nearest
·2015-10-30 13:49

cocos2d-x 纹理深入研究

nbsp;  CCSprite *pSprite = CCSprite::create("ship.png"); ccTexParams params = {GL_NEAREST
·2015-10-30 12:07

OpenGL入门笔记（六）

  Nehe在第6课里已经用了线性滤波了，并且还推荐我们把gl_nearest（不光滑）滤波方式和线性滤波结合起来使用，在近处时用线性滤波，在远处时用gl_nearest（不光滑
·2015-10-30 12:49

k近邻法

    k近邻法（k nearest neighbor algorithm，k-NN）是机器学习中最基本的分类算法，在训练数据集中找到k个最近邻的实例，类别由这k个近邻中占最多的实例的类别来决定
·2015-10-30 12:21

菜鸟进阶： C++实现KNN文本分类算法

作者:finallyliuyu(转载请注明原作者和出处) （代码暂不发布源码下载版，以后会发布）     KNN文本分类算法又称为(k nearest neighhor
·2015-10-30 12:52

NUC_HomeWork1 -- POJ2067(最短路)

Some residents have complained that the distance from their houses to the nearest station is too far,
·2015-10-30 11:37

opencv knn学习

K Nearest Neighbors 这个算法首先贮藏所有的训练样本，然后通过分析（包括选举，计算加权和等方式）一个新样本周围K个最近邻以给出该样本的相应值。
·2015-10-30 10:21

K-NN(K-Nearest Neighbor)算法的Matlab实现

代码实现function y = knn(x, x_train, y_train, K) % KNN K-Nearest Neig
初雪之音·2015-10-29 22:00

KNN分类算法的实现

关键词数据挖掘，分类算法，KNN分类 Implementationof K Nearest Neighbors AlgorithmABSTRACTKNN algorithm has been widely
Sunflowerfiona·2015-10-29 15:00

POJ 1330 Nearest Common Ancestors （LCA，dfs+ST在线算法）

Nearest Common Ancestors Time Limit: 1000MS   Memory Limit: 10000K Total Submissions
·2015-10-28 09:40

hdu 2645(find the nearest station) bfs+brute force

In the map consist of '0' and '1',find the nearest '1' for every '0'.
·2015-10-28 08:08

Nearest Common Ancestors

Nearest Common Ancestors Time Limit: 1000ms Case Time Limit: 1000ms Memory Limit: 
·2015-10-28 08:50

lca 在线，离线 poj 1330

题目链接：Nearest Common Ancestors 思路：利用flag来标记儿子结点，最后只有根节点没有被标记，那么没有被标记的点也就是根节点被我们找到了 在线做法： #include
·2015-10-28 08:53

Minimum Depth of Binary Tree [LeetCode]

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-27 15:41

【leetcode】Minimum Depth of Binary Tree (easy)

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-27 15:29

[LeetCode] Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-27 15:55

机器学习随笔01 - k近邻算法

算法名称: k近邻算法 (kNN: k-Nearest Neighbor) 问题提出: 根据已有对象的归类数据，给新对象(事物)归类。
·2015-10-27 14:12

K近邻算法

什么是K近邻算法     何谓K近邻算法，即K-Nearest Neighbor algorithm，简称KNN算法，单从名字来猜想，可以简单粗暴的认为是：K个最近的邻居，当K=1
·2015-10-27 13:32

统计学习方法笔记 -- KNN

K近邻法（K-nearest neighbor，k-NN），这里只讨论基于knn的分类问题，1968年由Cover和Hart提出，属于判别模型 K近邻法不具有显式的学习过程，算法比较简单，每次分类都是根据训练集中
·2015-10-27 12:18

KNN算法简介

KNN（K Nearest Neighbor）算法 一、算法思想： 假设一个样本空间里的样本分成几个类型[1]，然后给定一个待分类的数据，通过计算距离该数据最近的K个样本来判断这个待分类数据属于哪个分类
·2015-10-27 12:22

LeetCode:Minimum Depth of Binary Tree,Maximum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-27 11:30

POJ 1330 Nearest Common Ancestors

Nearest Common Ancestors Time Limit: 1000MS   Memory Limit: 10000K Total Submissions
·2015-10-27 11:04

[LeetCode] Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-23 08:57

[leedcode 111] Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-21 12:58

poj-1330 Nearest Common Ancestors **

/* * poj-1330.cpp * LCA * * LCA入门题 * * 没有用tarjan的离线算法， 用了个在线的， 时间复杂度O(n)-O(sqrt(n)) * * height为树的高度 * 把树按层次分成sqrt(height)个段，每段sqrt(height)层。 * * 对LCA(x, y) * 先把x, y 导入到同一段， 由于最多sqrt(height)段， 所以O(sqrt
·2015-10-21 12:47

Machine Learning Topics Covered

Supervised Learning: Decision trees, nearest neighbors, linear classifiers and kernels, neural networks
·2015-10-21 11:45

An Algorithm Summary of Programming Collective Intelligence (3)

k-Nearest Neighbors kNN(不要问我叫什么)PCI里面用kNN做了一个价格预测模型，还有一个简单的电影喜好预测。
·2015-10-21 11:29

fknn

function test_out = fknn(sample_in, sample_out, test_in, k, m) % FKNN Fuzzy k-nearest neighbor classification
·2015-10-21 11:41

转 经典的KNN算法解释

KNN全名是k-th nearest neighbor，中文意思是「第k位最接近的鄰居」。甚麼是「第k位最接近的鄰居」呢？假設在一個廣場上，有100個朋友，每位朋友都是你的鄰居，最接近你的鄰居，就
·2015-10-21 11:40

Leetcode:Minimum Depth of Binary Tree 二叉树的最短路径

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-21 11:25

Minimum Depth of Binary Tree leetcode java

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-10-21 10:56

线性插值计算

;p=imread('lv.jpg');p=imresize(p,0.1);fori=1:3 %分别对三个通道进行最邻近插值z1(:,:,i)=interp2(double(p(:,:,i)),2,'nearest
jialeheyeshu·2015-10-20 15:00

POJ 1330 Nearest Common Ancestors LCA--》RMQ or 纯DFS

NearestCommonAncestorsTimeLimit: 1000MS MemoryLimit: 10000KTotalSubmissions: 22446 Accepted: 11720DescriptionArootedtreeisawell-knowndatastructureincomputerscienceandengineering.Anexampleisshownbelow:
zp___waj·2015-10-19 20:00

poj1330Nearest Common Ancestors

NearestCommonAncestorsTimeLimit:1000MS MemoryLimit:10000KTotalSubmissions:22440 Accepted:11719DescriptionArootedtreeisawell-knowndatastructureincomputerscienceandengineering.Anexampleisshownbelow:Inth
acm_fighting·2015-10-18 20:00
上一页 12 13 14 15 16 17 18 19 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他