Click here to Skip to main content
12,756,745 members (31,339 online)

Algorithms

 
QuestionBest autorrelation function Pin
Russell'7-May-13 1:36
memberRussell'7-May-13 1:36 
QuestionPattern matching in trees, lists and strings alike Pin
bjongejan11-Apr-13 10:19
memberbjongejan11-Apr-13 10:19 
AnswerRe: Pattern matching in trees, lists and strings alike Pin
dusty_dex11-Apr-13 12:44
memberdusty_dex11-Apr-13 12:44 
GeneralRe: Pattern matching in trees, lists and strings alike Pin
bjongejan11-Apr-13 23:49
memberbjongejan11-Apr-13 23:49 
GeneralRe: Pattern matching in trees, lists and strings alike Pin
dusty_dex12-Apr-13 0:04
memberdusty_dex12-Apr-13 0:04 
GeneralRe: Pattern matching in trees, lists and strings alike Pin
bjongejan12-Apr-13 10:25
memberbjongejan12-Apr-13 10:25 
GeneralRe: Pattern matching in trees, lists and strings alike Pin
Kosta Cherry5-Jun-13 21:04
memberKosta Cherry5-Jun-13 21:04 
QuestionAlgorithm Pin
Member 99636023-Apr-13 16:11
memberMember 99636023-Apr-13 16:11 
Hi All,

I am not sure if i am in the rite place for this question but i want to know if it is possable to create an algorithm based around a name or a word.

The end result for this is to create a unique aesthetic logo derived from an object which can be 3d printed and doesnt look like complete chaos.

If anyone can point me in the rite direction or answer my question it would be a great help. I am a complete novice and have little to know idea what i am talking about so try not to be too wordy in your explinations.

Thanks all,

Angus
AnswerRe: Algorithm Pin
BupeChombaDerrick8-Apr-13 0:39
memberBupeChombaDerrick8-Apr-13 0:39 
QuestionAlignment and rectification of polylines Pin
Chesnokov Yuriy1-Apr-13 9:09
memberChesnokov Yuriy1-Apr-13 9:09 
AnswerRe: Alignment and rectification of polylines Pin
Kenneth Haugland3-Apr-13 0:31
memberKenneth Haugland3-Apr-13 0:31 
AnswerRe: Alignment and rectification of polylines Pin
Jacek Gajek4-Jun-13 13:57
memberJacek Gajek4-Jun-13 13:57 
QuestionConsider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Lik Pin
amistry_petlad28-Mar-13 8:08
memberamistry_petlad28-Mar-13 8:08 
AnswerRe: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Pin
mark merrens28-Mar-13 8:24
membermark merrens28-Mar-13 8:24 
AnswerRe: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Pin
Richard MacCutchan28-Mar-13 8:25
mvpRichard MacCutchan28-Mar-13 8:25 
GeneralRe: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Pin
amistry_petlad28-Mar-13 8:51
memberamistry_petlad28-Mar-13 8:51 
GeneralRe: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Pin
Richard MacCutchan28-Mar-13 8:58
mvpRichard MacCutchan28-Mar-13 8:58 
AnswerRe: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Pin
Jacek Gajek4-Jun-13 14:06
memberJacek Gajek4-Jun-13 14:06 
QuestionThe degree of a node in a tree is the number of children the node has. If a tree has n1 nodes of degree 1, n2 nodes of degree 2, ..., nm nodes of degree m, compute the number of leaves in the tree in terms of n1, n2, . . . , nm. Pin
amistry_petlad28-Mar-13 8:04
memberamistry_petlad28-Mar-13 8:04 
NewsCaltech's FREE online Machine Learning course -- LAST CHANCE Pin
Matt T Heffron27-Mar-13 12:53
memberMatt T Heffron27-Mar-13 12:53 
NewsNew computer vision algorithms, check out the videos Pin
BupeChombaDerrick20-Feb-13 21:33
memberBupeChombaDerrick20-Feb-13 21:33 
GeneralRe: New computer vision algorithms, check out the videos Pin
Simon_Whale1-Mar-13 1:13
memberSimon_Whale1-Mar-13 1:13 
GeneralRe: New computer vision algorithms, check out the videos Pin
BupeChombaDerrick2-Mar-13 0:24
memberBupeChombaDerrick2-Mar-13 0:24 
QuestionComplexity and Routing Problems Pin
brkonja18-Feb-13 14:10
memberbrkonja18-Feb-13 14:10 
AnswerRe: Complexity and Routing Problems Pin
Alan Balkany21-Feb-13 5:24
memberAlan Balkany21-Feb-13 5:24 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.


Advertise | Privacy | Mobile
Web02 | 2.8.170217.1 | Last Updated 18 Feb 2017
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid