E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
algorithms
机器学习算法之旅A Tour of Machine Learning
Algorithms
Inthispostwetakeatourofthemostpopularmachinelearning
algorithms
.Itisusefultotourthemain
algorithms
inthefieldtogetafeeling
GarfieldEr007
·
2016-03-07 00:10
生成模型与判别模型
首先摘抄一段Andrew的话，从思想上把握一下区别：
Algorithms
thattrytolearnp(y|x)directly(suchaslogisticregression),or
algorithms
thattrytolearnmappingsdirectlyfromthespaceofinputsXtothelabels
qiusuoxiaozi
·
2016-03-07 00:00
生成模型-判别模型
Java [Leetcode 268]Missing Number
distinctnumberstakenfrom 0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Given nums = [0,1,3] return 2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Cou
scottwang
·
2016-03-06 20:00
nyoj 306 4th河南省赛 走迷宫【dfs】【二分】
id=1852思路参考：http://www.cnblogs.com/
algorithms
/archive/2012/07/10/2584420.html比赛时这道没有写出来，思路是dfs+二分
wlx65003
·
2016-03-05 23:00
ACM
First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.Your
algorithms
houldruninO
KickCode
·
2016-03-05 19:44
桶排序
41. First Missing Positive *HARD*
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
ArgenBarbie
·
2016-03-05 19:00
Information-Theoretic Metric Learning
PPT/部分资料算是对这篇论文自己学习的笔记吧，云盘里有提供论文以及作者后期相关工作论文，还有自己做presentation的PPT和遇到问题所查的一些文献，关于求解凸优化问题的经典算法（Bregman
Algorithms
ZoeyeoZ
·
2016-03-05 14:44
numpy.argsort
order=None)[source]Returnstheindicesthatwouldsortanarray.Performanindirectsortalongthegivenaxisusingthe
algorithms
pecifiedbythekindkeyword.I
iamzhangzhuping
·
2016-03-05 14:00
[leetcode Q41] First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.Your
algorithms
houldruninO
u012675539
·
2016-03-04 23:00
LeetCode
数组
数据结构和算法经典书籍
●《数据结构算法与应用——C++语言描述》（DataStructures,
Algorithms
andApplicationsinC++）第一版，SartajSahni著，国防科技大学汪诗林、孙晓东等译，
duguliuhu190
·
2016-03-04 18:50
数据结构与算法
Leet Code OJ 268. Missing Number [Difficulty: Easy]
Givenanarraycontainingndistinctnumberstakenfrom0,1,2,…,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyouimpleme
Lnho2015
·
2016-03-04 18:00
LeetCode
算法
数组
Leet Code OJ 268. Missing Number [Difficulty: Easy]
Givenanarraycontainingndistinctnumberstakenfrom0,1,2,…,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyouimpleme
Lnho2015
·
2016-03-04 18:00
LeetCode
算法
数组
Flask挺好
近几天在看一本叫《DataStructuresand
Algorithms
withPython》
billiepander
·
2016-03-04 17:00
初识Spark 1.6.0
1、Spark发展背景Spark由加州大学伯克利分校AMP实验室(
Algorithms
,Machines,andPeopleLab)以Matei为主的小团队使用Scala语言所开发，后期成立spark商业公司
安伦_Alan
·
2016-03-03 14:23
Spark
[Theano] Theano初探
Theanowaswrittenatthe LISA labtosupportrapiddevelopmentofefficientmachinelearning
algorithms
.Theanoisnamedafterthe
CarlGoodman
·
2016-03-03 11:00
关于SSE的一些资料
articles/using-intel-streaming-simd-extensions-and-intel-integrated-performance-primitives-to-accelerate-
algorithms
http
waytofall
·
2016-03-03 11:00
leetcode第24题——**Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
buptlrw
·
2016-03-03 09:00
java
LeetCode
python
24. Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
水果拼盘武士G
·
2016-03-02 23:00
RSA Study
mystudyhasnotfinished.Thereremainsmanyotherthingstodo.E.g.ProgramtorealiseRSA;UseApplicationswithRSAStudyotherencrypt
algorithms
brant-ruan
·
2016-03-02 22:00
深度学习数据集Deep Learning Datasets
DatasetsThesedatasetscanbeusedforbenchmarkingdeeplearning
algorithms
:SymbolicMusicDatasetsPiano-midi.de
garfielder007
·
2016-03-02 12:30
Deep
Learning
LeetCode题目难度分布（含面试频率及使用的数据结构与算法）
ID Question Diff Freq DataStructure
Algorithms
1TwoSum25arraysort
hellochenlu
·
2016-03-02 11:00
《leetCode》：Single Number II
Note: Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory?
u010412719
·
2016-03-01 18:00
LeetCode
算法
number
single
《leetCode》：Single Number
Note: Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory?
u010412719
·
2016-03-01 10:00
LeetCode
SingleNumb
并查集详解
更多的信息可以参考
Algorithms
一书的Section1.5，实际上本文也就是基于它的一篇读后感吧。
LaoJiu_
·
2016-03-01 09:00
数据结构
算法
搜索
并查集
Generic
Algorithms
概述标准范型算法不依赖任何类型，唯一隐式依赖的情况是，必须能够对元素做比较。我在想每次比如查找失败的时候返回的一般都是容器的末端迭代器，为什么不返回false，设计者是为了表示对原则的恪守，还是有必须这样做的理由呢。范型算法需要容器内元素能够比较，就是要支持==操作，假如不支持的话，还有后备方案，就是需要一个额外参数：实现元素比较的函数名字。算法永远不会执行特定容器提供的操作，这是原则，假如那种容
arctanx
·
2016-02-29 16:00
leetcode笔记：Majority Element II
一.题目描述Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
Herbert_Zero
·
2016-02-28 20:55
数据结构与算法
leetcode笔记
leetcode笔记：Majority Element II
一.题目描述Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
liyuefeilong
·
2016-02-28 20:00
LeetCode
C++
算法
vote
Moore
Leet Code OJ 136. Single Number [Difficulty: Medium]
题目：Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
Lnho2015
·
2016-02-26 11:00
算法
LeetCode 41. First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.Your
algorithms
houldruninO
暖日初升
·
2016-02-26 07:00
一个数据结构与算法可视化的网站
http://www.cs.usfca.edu/~galles/visualization/
Algorithms
.html
github_33890270
·
2016-02-23 14:00
数据结构
可视化
Majority Element II
Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
KickCode
·
2016-02-23 09:01
Moore
Voting算法
leetcode刷题系列C++-single number II
Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
u013676711
·
2016-02-22 17:00
leetcode刷题系列C++-single number I
Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
u013676711
·
2016-02-22 16:00
spark_3：spark的基础
RDD可被切分由一个函数计算每一个分片对其他的RDD依赖可选：key-value的rdd是根据hash来分区的，类似于partitioner接口RDD计算模式Iterative
Algorithms
RelationalQueriesMapRdecueStreamingRDD
mijian1207mijian
·
2016-02-21 16:00
136.Single Number
Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
torrescx
·
2016-02-20 20:00
LeetCode 268. Missing Number
distinctnumberstakenfrom 0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Given nums = [0,1,3] return 2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyou
Appletable
·
2016-02-20 16:00
Stanford公开课Machine learning第一课
Machinelearning,abranchofartificialintelligence,isascientificdisciplineconcernedwiththedesignanddevelopmentof
algorithms
thattakeasinputempiricaldata
Aga.J
·
2016-02-20 15:48
C/C++ 函数所在的头文件（二）
头文件stuffheader说明mallocexitstrlen也给出了该函数的实现自然无需在std的命名空间中typeid但不在std标准命名空间中C++头文件stuffheader说明min/max
algorithms
tdcstdlib
lanchunhui
·
2016-02-20 08:00
leetcode：Swap Nodes in Pairs
swapeverytwoadjacent（相邻的）nodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
carsonzhu
·
2016-02-19 15:00
leetcode笔记：Missing Number
Givenanarraycontainingndistinctnumberstakenfrom0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyouim
liyuefeilong
·
2016-02-19 14:00
LeetCode
C++
算法
异或
XOR
LeetCode -- Single Number II
Question:Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
码代码的小女孩
·
2016-02-19 11:00
标准模板库（Standard Template Library，STL）学习
编写代码的方法、STL代码的编译和调试、命名空间（namespace）、STL中的ANSI/ISO字符串、各种不同类型的容器（container）、模板（template）、游标（Iterator）、算法（
Algorithms
dubuyunduan85
·
2016-02-19 10:02
c++
LeetCode题解-----First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
姚灯灯!
·
2016-02-18 22:00
LeetCode题解-----First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
姚灯灯!
·
2016-02-18 22:00
LeetCode 137 Single Number II（只出现一次的数字 II）（*）
原文Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomp
nomasp
·
2016-02-18 19:12
LeetCode
LeetCode 137 Single Number II（只出现一次的数字 II）（*）
Note: Your
algorithms
houldhavealinearrunti
NoMasp
·
2016-02-18 19:00
LeetCode
位运算
number
single
137
LeetCode 137 Single Number II（只出现一次的数字 II）（*）
Note: Your
algorithms
houldhavealinearrunti
NoMasp
·
2016-02-18 19:00
LeetCode
位运算
number
single
137
mysql5.6子查询的优化
subquery-optimization.html Semi-joininMySQL5.6 MySQL5.6.5DevelopmentMilestoneReleasehasawholenewsetof
algorithms
forprocessingsubqueries.Itisbasedontransformingas
yuyue2014
·
2016-02-18 16:00
LeetCode 136 Single Number（只出现一次的数字）
Note: Your
algorithms
houldhavealinearrun
NoMasp
·
2016-02-18 15:00
LeetCode
vector
single
Numbers
136
LeetCode 136 Single Number（只出现一次的数字）
Note: Your
algorithms
houldhavealinearrun
NoMasp
·
2016-02-18 15:00
LeetCode
vector
single
Numbers
136
上一页
87
88
89
90
91
92
93
94
下一页
按字母分类：
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他