Algorithms:

UCF 大牛 Prof. Shah 课题组代码合集

SourceCode[BackgroundModeling][ShapefromShading][FundamentalMatrix][Mean-ShiftAlgorithms][Ke
kaka20080622·2014-07-22 16:00

codeforces 449C construtive algorithms,number theory

题目连接C.JzzhuandApplestimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputJzzhuhaspicked n applesfromhisbigappletree.Alltheapplesarenumberedfrom 1 to n.Nowhewantst
ocgcn2010·2014-07-21 14:00

LeetCode Single Number

Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
Ares_晓越·2014-07-21 11:48

LeetCode Single Number

Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
Ares_晓越·2014-07-21 11:48

细数二十世纪最伟大的十大算法

转自译者：July   二零一一年一月十日------------------------------------参考文献：TheBestofthe20thCentury:EditorsNameTop10Algorithms
gaylord·2014-07-20 11:00

智能指针tr1::shared_ptr、boost::shared_ptr使用

而boost作为tr1的实现品，包含“AlgorithmsBrokenCompilerWorkaroundsConcurrentProgrammingContainersCorrectnessandTestingDataStructuresDomainSpecificFunctionObjectsandHigher
u012150179·2014-07-19 17:00

UVA - 586 Instant Complexity

Description InstantComplexity Analyzingtherun-timecomplexityofalgorithmsisanimportanttoolfordesigningefficientprogramsthatsolveaproblem.Analgorithmthatrunsinlineartimeisusuallymuchfasterthananalgorith
u011345136·2014-07-19 14:00

二十世纪最伟大的10大算法

译者：July   二零一一年一月十日------------------------------------参考文献：TheBestofthe20thCentury:EditorsNameTop10Algorithms
u014492609·2014-07-18 20:00

Sorting Algorithms Review

IntroductionUnderstandingthebasicconceptsofthepopularsortingalgorithms,cannotonlyhelpyoubetterunderstandthedatastructureandalgorithmfromadifferentperspective
sbitswc·2014-07-18 04:00

并查集(Union-Find)算法介绍

更多的信息可以参考Algorithms 一书的Section1.5，实际上本文也就是基于它的一篇读后感吧。
zchlww·2014-07-17 14:00

HDU - 1845 Jimmy’s Assignment （二分匹配）

DescriptionJimmyisstudyingAdvancedGraphAlgorithmsathisuniversity.Hismostrecentassignmentistofindamaximummatchinginaspecialkindofgraph.Thisgraphisundirected
u011345136·2014-07-16 11:00

caffe安装指南（Ubuntu13.04 x86)

Caffeisaframeworkforconvolutionalneuralnetworkalgorithms,developedwithspeedinmind.ItwascreatedbyYangqingJia
u011333059·2014-07-14 22:00

Single Number

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
LeotyLiu·2014-07-10 14:00

Naive Bayes algorithm for spam classification （Matlab实现）

Materials,data,andalgorithmscomesfromStanfordAndrewNgMachineLearningcourseProblemset2(Q3).1.Preprocessing
William_Dong·2014-07-10 02:35

C++标准容器模板库 声明集合

3869995C++StandardTemplateLibraryTheC++STL(StandardTemplateLibrary)isagenericcollectionofclasstemplatesandalgorithmsthatallowprogrammerstoeasilyimple
u012307430·2014-07-07 17:00

【LeetCode】Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given1->2->3->4,youshouldreturnthelistas2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmaynotmodifythevaluesinthelist
Mars_NAVY·2014-07-07 14:00

算法导论（Introduction to Algorithms ）— 第十二章 二叉搜索树— 12.1 什么是二叉搜索树

搜索树数据结构支持许多动态集合操作，如search（查找）、minmum（最小元素）、maxmum（最大元素）、predecessor（前驱）、successor（后继）、insert（插入）、delete（删除），这些都是基本操作，可以使用一颗搜索树当做一个字典或者一个优先队列。12.1、什么事二叉搜索树二叉搜索树是以一棵二叉树来组织的，可以用一个链表数据结构来表示，也叫二叉排序树、二叉查找树；
zxnlmj·2014-07-02 22:00

reference for TCP friendliness

TCPfriendlinessneededtobesatisfied.TCPfriendlinessmeansthattheaveragethroughputofapplicationusingthenewcongestioncontrolalgorithmshouldNOTexceedthatoftradi
yzhsuper·2014-07-02 22:00

并查集(Union-Find)算法介绍

更多的信息可以参考Algorithms 一书的Section1.5，实际上本文也就是基于它的一篇读后感吧。原文中更多的是给出一些结论，我尝试给出一些思路上的过程，即为什么要使用
fyfcauc·2014-06-30 09:00

ICA扩展描述

7.ICA算法扩展描述    上面介绍的内容基本上是讲义上的，与我看的另一篇《IndependentComponentAnalysis:AlgorithmsandApplications》（AapoHyvärinenandErkkiOja
wenyusuran·2014-06-27 18:00

[LeetCode]Single Number II

Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
sbitswc·2014-06-26 23:00

[LeetCode]Single Number

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
sbitswc·2014-06-26 22:00

Opencv简介及学习路线

OpenCVisanopensourcecomputervisionandmachinelearningsoftwarelibrary.Thelibraryhasmorethan2500optimizedalgorithms
dengtaocs·2014-06-26 08:51

[leetcode] First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.YouralgorithmshouldruninO
jdflyfly·2014-06-25 23:00

[leetcode] Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given1->2->3->4,youshouldreturnthelistas2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmaynotmodifythevaluesinthelist
jdflyfly·2014-06-25 13:00

uva 270 - Lining Up

不过这个题目以前在上普林斯顿的algorithms里有个大程跟这个95%相似的问题，所以我一下子就想到了优化的解法，复杂度是O((n^2)logn)。
jdflyfly·2014-06-24 20:00

LeetCode——Single Number II

Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
ozhaohuafei·2014-06-24 13:00

LeetCode——Single Number

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
ozhaohuafei·2014-06-23 20:00

[leetcode]First Missing Positive

FirstMissingPositiveFirstMissingPositiveGivenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.YouralgorithmshouldruninO
huntfor·2014-06-22 16:00

几个开源几何计算数学库

b) CGAL CGAL的全称就是Computational Geometry Algorithms
·2014-06-20 16:00

Some web Address

1.可视化算法(Data Structure Visualizations) https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
·2014-06-19 15:00

[LeetCode41] First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
sbitswc·2014-06-17 23:00

Matrix Factorization, Algorithms, Applications, and Avaliable packages

来源：http://www.cvchina.info/2011/09/05/matrix-factorization-jungle/美帝的有心人士收集了市面上的矩阵分解的几乎所有算法和应用，由于源地址在某神秘物质之外，特转载过来，源地址MatrixDecompositions hasalonghistoryandgenerallycentersaroundasetofknownfactorizat
todayq·2014-06-16 08:00

Foundations of Machine Learning: The PAC Learning Framework(1)

：本系列主要是在阅读MehryarMohri等的最新书籍《FoundationsofMachineLearning》以及Schapire和Freund的《Boosting:FoundationsandAlgorithms
Boostable·2014-06-15 21:00

Simhash的巧妙

Simhash是localitysensitivehash（局部敏感哈希）的一种，最早由MosesCharikar在《similarityestimationtechniquesfromroundingalgorithms
丕子·2014-06-14 06:00

两个学数据结构等算法的好去处

http://blog.51cto.com/zt/595 他人博客的文章http://www.cs.usfca.edu/~galles/visualization/Algorithms.html 可视化学习网站
懂点写点·2014-06-13 14:20

Matrix Factorization, Algorithms, Applications, and Avaliable packages

来源：http://www.cvchina.info/2011/09/05/matrix-factorization-jungle/美帝的有心人士收集了市面上的矩阵分解的几乎所有算法和应用，由于源地址在某神秘物质之外，特转载过来，源地址MatrixDecompositions hasalonghistoryandgenerallycentersaroundasetofknownfactorizat
abcjennifer·2014-06-13 00:00

使用Networkx进行overlapping community 重叠社区检测

http://networkx.lanl.gov/reference/generated/networkx.algorithms.community.kclique.k_clique_communities.html
SecondLife·2014-06-13 00:00

LeetCode First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.YouralgorithmshouldruninO
xyzchenzd·2014-06-12 10:00

[LeetCode24]Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay
sbitswc·2014-06-11 23:00

LeetCode First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.YouralgorithmshouldruninO
star_liux·2014-06-11 21:00

每日算法之三十二：First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
yapian8·2014-06-10 21:00

【leetcode】First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
shiquxinkong·2014-06-09 19:00

【LeetCode OJ】Single Number

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
aqia358·2014-06-09 13:00

Topic model:materials and tools

http://www.cs.princeton.edu/~blei/topicmodeling.htmlTopicmodelingTopicmodelsareasuiteofalgorithmsthatuncoverthehiddenthematicstructureindocumentcollections.Thesealgorithmshelpusdevelopnewwaystosearch
lansatiankongxxc·2014-06-08 22:00

Spark1.0.0 生态圈一览

   Spark生态圈，也就是BDAS（伯克利数据分析栈），是伯克利APMLab实验室精心打造的，力图在算法（Algorithms）、机器（Machines）、人（People）之间通过大规模集成，来展现大数据应用的一个平台
book_mmicky·2014-06-08 13:00

并查集(Union-Find)算法介绍

更多的信息可以参考Algorithms 一书的Section1.5，实际上本文也就是基于它的一篇读后感吧。
面码·2014-06-06 15:00

UVa live6525Attacking rooks（二分最大匹配之最大匹配）

com_onlinejudge&Itemid=8&page=show_problem&problem=4536Chessinspiredproblemsareacommonsourceofexercisesinalgorithmsclasses.Startingwiththewellk
u013013910·2014-06-06 09:00

[ LeetCode ] Single Number II [4]

题目Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
swagle·2014-06-04 10:00

[ LeetCode] Single Number [3]

题目Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
swagle·2014-06-04 08:00
上一页 111 112 113 114 115 116 117 118 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他