algorithms 第103页

New Technology

A Simple Compiler for the Common Language Runtimehttp://www.codeproject.com/cs/algorithms/compiler.aspCheck

·2015-10-21 13:41

[Algorithms] Radix Sort

Radix sort is another linear time sorting algorithm. It sorts (using another sorting subroutine) the numbers from their least significant digits to most significant digits. To guarantee the correctnes

·2015-10-21 12:19

[LeetCode] Largest Number

For more information about radix sort, Introduction to Algorithms, 3rd edition has some nice examples

·2015-10-21 12:18

[Algorithms] Counting Sort

Counting sort is a linear time sorting algorithm. It is used when all the numbers fall in a fixed range. Then it counts the appearances of each number and simply rewrites the original array. For a nic

·2015-10-21 12:17

[Algorithms] Sorting Algorithms (Insertion Sort, Bubble Sort, Merge Sort and Quicksort)

Recently I systematicall review some sorting algorithms, including insertion sort, bubble sort, merge

·2015-10-21 12:06

[Algorithms] Heap and Heapsort

I reviewed the classic heapsort algorithm and implement it according to contents in Introduction to Algorithms

·2015-10-21 12:05

Cheatsheet: 2012 02.09 ~ 02.29

Mobile PhoneGap From Scratch: Camera & Exporting Web MapReduce Patterns, Algorithms,

·2015-10-21 12:17

Euclid's algorithms for GCD

GCD is the greatest common divisor. pseudo-code: function Euclid(x,y) if y==0 return x; return Euclid(y, x MOD y). correctness: Euclid's rule: If x and y are positive integers with x >= y, the

·2015-10-21 12:19

Tao Yu的论文之三 "Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints

Lin, "Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints&

·2015-10-21 11:03

Tao Yu的论文之二 "Adaptive algorithms for Finding Replacement Services in Autonomic Distributed Business Processes

Lin, "Adaptive algorithms for Finding Replacement Services in Autonomic Distributed Business Processes

·2015-10-21 11:02

Tao Yu的论文之一 "Service Selection Algorithms for Web Services with End-to-end QoS Constraints (ISeBM2005

Yu Tao 个人主页: http://link.ece.uci.edu/tyu/index.html 个人简历上介绍, 本科就读于成都电子科技大学(1995), 硕士是北邮(1998), PhD在University of California, Irvine(2002), 博士论文的题目是"QoS (Quality of Service) in Web Services:

·2015-10-21 11:01

Web Service Replacement相关论文收集

Adaptive algorithms for finding replacement services in autonomic distributed business processes.

·2015-10-21 11:55

机器学习PartIII：测试算法和NFL定理

原文作者：aihorizon.com原文链接： Machine Learning, Part III: Testing Algorithms, and The "No Free译者：commondata

·2015-10-21 11:37

An Algorithm Summary of Programming Collective Intelligence (5)

Optimization 优化 PCI里面介绍了两个算法：simulated annealing，模拟退火和genetic algorithms，遗传算法。

·2015-10-21 11:31

Video compression picture types

In the field of video compression a video frame is compressed using different algorithms with different

·2015-10-21 11:32

机器学习算法复习--层次聚类2

层次聚类算法 Hierarchical Clustering Algorithms 基本工作原理给定要聚类的N的对象以及N*N的距离矩阵(或者是相似性矩阵), 层次式聚类方法的基本步骤(

·2015-10-21 11:51

The Aggregate Magic Algorithms

http://aggregate.org/MAGIC/ The Aggregate Magic Algorithms There are lots of people and places

·2015-10-21 10:59

28.Single Number

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory

u010339647·2015-10-19 22:00

lintcode-Swap Nodes in Pairs -451

swapeverytwoadjacentnodesandreturnitshead.样例Given1->2->3->4,youshouldreturnthelistas2->1->4->3.挑战Youralgorithmshoulduseonlyconstantspace.Youmaynotmodifythevaluesinthelist

ljlstart·2015-10-18 21:00

Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Given 1->2->3->4,youshouldreturnthelistas2->1->4->3.挑战Youralgorithmshoulduseonlyconstantspace.Youmaynotmodifythevaluesinthelist

brucehb·2015-10-18 18:00

hdoj 1845 Jimmy’s Assignment 【HK】

Others)TotalSubmission(s):1304 AcceptedSubmission(s):527ProblemDescriptionJimmyisstudyingAdvancedGraphAlgorithms

chenzhenyu123456·2015-10-17 10:00

普林斯顿大学算法第一部分学习总结（Week1-Percolation）

AlgorithmsPart1课程第一周的ProgrammingAssignment是Percolation问题，该问题是Union-Find算法的一个应用实例。

dandandehv·2015-10-17 07:22

海量数据挖掘MMDS week3:流算法Stream Algorithms

pipisorry/article/details/49183379海量数据挖掘MiningMassiveDatasets(MMDs)-JureLeskoveccourses学习笔记之流算法StreamAlgorithmsStreamAlgorithms

-柚子皮-·2015-10-16 20:03

海量数据挖掘MMDS week3:流算法Stream Algorithms

pipisorry/article/details/49183379海量数据挖掘MiningMassiveDatasets(MMDs)-JureLeskovec courses学习笔记之流算法StreamAlgorithmsStreamAlgorithms

pipisorry·2015-10-16 20:00

LeetCode----Single NumberII

SingleNumberIIGivenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory

whiterbear·2015-10-15 11:00

实验报告 - C# HashAlgorithm.TransformBlock 方法

classHashAlgorithmTest{publicstaticvoidMain(){byte[]data=Encoding.UTF8.GetBytes("abcdefghijklmn");HashAlgorithmsha1

Ocean·2015-10-13 00:00

Faster Parallel Reductions on Kepler

Parallelreductionisacommonbuildingblockformanyparallelalgorithms.A presentationfrom2007byMarkHarris providedadetailedstrategyforimplementingparallelreductionsonGPUs

colddie·2015-10-12 23:00

LeetCode----Single Number

SingleNumberGivenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory

whiterbear·2015-10-12 22:00

[LeetCode-268] Missing Number（找缺失的数字）

distinctnumberstakenfrom 0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Given nums = [0,1,3] return 2.Note:Youralgorithmshouldruninlinearruntimecomplexity.Couldyou

xy010902100449·2015-10-12 17:00

GPU 矩阵乘法（转）

MatrixmultiplicationinCUDAMatrixmultiplicationisafundamentalbuildingblockforscientificcomputing.Moreover,thealgorithmicpatternsofmatrixmultiplicationarerepresentative.Manyotheralgorithmssharesimilarop

lishuiwang·2015-10-12 14:43

GPU 矩阵乘法（转）

MatrixmultiplicationinCUDAMatrixmultiplicationisafundamentalbuildingblockforscientificcomputing.Moreover,thealgorithmicpatternsofmatrixmultiplicationarerepresentative.Manyotheralgorithmssharesimilarop

lishuiwang·2015-10-12 14:00

【LeetCode从零单刷】Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay

yOung_One·2015-10-11 10:00

leetcode 24:Swap Nodes in Pairs(15-10-11)

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay

onlyou2030·2015-10-11 10:00

leetcode--single number.

Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwith

junli_chen·2015-10-10 21:00

LeetCode -- Single Number

题目描述：Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory

csharp25·2015-10-10 19:00

LeetCode -- Missing Number

Givenanarraycontainingndistinctnumberstakenfrom0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Youralgorithmshouldruninlinearruntimecomplexity.Couldyouimp

_iorilan·2015-10-10 19:14

LeetCode -- Missing Number

Givenanarraycontainingndistinctnumberstakenfrom0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Youralgorithmshouldruninlinearruntimecomplexity.Couldyouimp

csharp25·2015-10-10 19:00

leetcode | Single Number

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory

weizaishouex2010·2015-10-10 16:00

LeetCode Majority Element II(Moore Voting Algorithm即Majority Voting Algorithm)

Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.ThealgorithmshouldruninlineartimeandinO

wuli2496·2015-10-09 22:00

首个正数，给定一个无序整形数组，找出第一个不在数组里的正整数。要求时间复杂度0（n），空间复杂度o（1）

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin

zcf396720·2015-10-09 11:00

Spectral Algorithm

SpectralAlgorithm[转自网络，参考用]有关SpectralAlgorithmsigchi结束之后，这两天看了下spectralalgorithm的一些相关的paper。

u013719780·2015-10-07 20:00

Machine Learning Algorithms Study Notes(4)—无监督学习（unsupervised learning）

1 UnsupervisedLearning 1.1 k-meansclusteringalgorithm 1.1.1 算法思想 1.1.2 k-means的不足之处 1.1.3 如何选择K值 1.1.4 SparkMLlib实现k-means算法 1.2 MixtureofGaussiansandtheEMalgorithm

u013719780·2015-10-05 11:00

Machine Learning Basics（要点）

目录：MachineLearningBasicsLearningAlgorithmsTheTaskTThePerformanceMeasurePTheExperienceEExampleLinearRegressionGeneralizationCapacityOverfittingandUnderfittingTheNoFreeLunchTheoremRegularizationHyperpar

u011762313·2015-10-03 18:00

hdu 5486 Difference of Clustering 2015多校联合训练赛

(Java/Others)TotalSubmission(s):320 AcceptedSubmission(s):112ProblemDescriptionGiventwoclusteringalgorithms

firenet1·2015-10-01 09:00

【POJ】 Instant Complexity (模拟)

1000MS MemoryLimit: 10000KTotalSubmissions: 1905 Accepted: 657DescriptionAnalyzingtherun-timecomplexityofalgorithmsisanimportanttoolfordesigningef

ChallengerRumble·2015-09-30 11:00

Spark MLlib之机器学习（一）

定义先看一下机器学习的定义，以下是Wikipedia的定义：Machinelearningisascientificdisciplinethatexplorestheconstructionandstudyofalgorithmsthatcanlearnfromdata

u010376788·2015-09-29 21:00

第一层内容：杂题

AdHocProblems`Adhoc'problemsarethosewhosealgorithmsdonotfallintostandardcategorieswithwell-studiedsolutions.Eachadhocproblemisdifferent

int_int_int·2015-09-29 20:42

OCP-V13-053

QUESTION53YouwanttouseRMANtocreatecompressedbackups.WhichstatementistrueaboutthecompressionalgorithmsthatRMANcanuse

xuejiayue1105·2015-09-28 23:00

Leetcode: First Missing Positive

QuestionGivenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.YouralgorithmshouldruninO

ayst123·2015-09-25 10:00

leetcode-41 First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin

woliuyunyicai·2015-09-24 08:00

推荐频道

algorithms

New Technology

[Algorithms] Radix Sort

[LeetCode] Largest Number

[Algorithms] Counting Sort

[Algorithms] Sorting Algorithms (Insertion Sort, Bubble Sort, Merge Sort and Quicksort)

[Algorithms] Heap and Heapsort

Cheatsheet: 2012 02.09 ~ 02.29

Euclid's algorithms for GCD

Tao Yu的论文之三 "Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints

Tao Yu的论文之二 "Adaptive algorithms for Finding Replacement Services in Autonomic Distributed Business Processes

Tao Yu的论文之一 "Service Selection Algorithms for Web Services with End-to-end QoS Constraints (ISeBM2005

Web Service Replacement相关论文收集

机器学习PartIII：测试算法和NFL定理

An Algorithm Summary of Programming Collective Intelligence (5)

Video compression picture types

机器学习算法复习--层次聚类2

The Aggregate Magic Algorithms

28.Single Number

lintcode-Swap Nodes in Pairs -451

Swap Nodes in Pairs

hdoj 1845 Jimmy’s Assignment 【HK】

普林斯顿大学算法第一部分学习总结（Week1-Percolation）

海量数据挖掘MMDS week3:流算法Stream Algorithms

海量数据挖掘MMDS week3:流算法Stream Algorithms

LeetCode----Single NumberII

实验报告 - C# HashAlgorithm.TransformBlock 方法

Faster Parallel Reductions on Kepler

LeetCode----Single Number

[LeetCode-268] Missing Number（找缺失的数字）

GPU 矩阵乘法（转）

GPU 矩阵乘法（转）

【LeetCode从零单刷】Swap Nodes in Pairs

leetcode 24:Swap Nodes in Pairs(15-10-11)

leetcode--single number.

LeetCode -- Single Number

LeetCode -- Missing Number

LeetCode -- Missing Number

leetcode | Single Number

LeetCode Majority Element II(Moore Voting Algorithm即Majority Voting Algorithm)

首个正数，给定一个无序整形数组，找出第一个不在数组里的正整数。要求时间复杂度0（n），空间复杂度o（1）

Spectral Algorithm

Machine Learning Algorithms Study Notes(4)—无监督学习（unsupervised learning）

Machine Learning Basics（要点）

hdu 5486 Difference of Clustering 2015多校联合训练赛

【POJ】 Instant Complexity (模拟)

Spark MLlib之机器学习（一）

第一层内容：杂题

OCP-V13-053

Leetcode: First Missing Positive

leetcode-41 First Missing Positive