Ayman Ahmed

 

Top Tags Applied by Ayman	1 - 5 of 5
algorithm, maxflow mincut, maximum flow, minimum cut, segment objects

Files Tagged by Ayman					View all 1 - 3 of 3
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
03 Apr 2008		Ford-Fulkerson algorithm The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl Author: Bing He	maxflow mincut, minimum cut, maximum flow, wireless	34	5
30 Sep 2005		Prims Algorithm Minimal spanning tree. Author: Vikramaditya Kundur	algorithm, specialized, graphics, specialized plot, plotting, spanning	32	4	4.0 4.0 | 8 ratings
01 Nov 2002		Lidar Imaging Case Study(with Geometric Distortion Correction) Case study used in Advanced Image Processing seminars (highlights algorithm development) Author: Robert Bemis	segment objects, application, remove distortion bac..., measure features	35	2	3.33333 3.3 | 3 ratings

Files Matching Ayman's Watch List					1 - 1 of 1
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
20 Dec 2006		Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos	graphics, i want to signal a ms..., kruskal, specialized plot, algorithm, plotting	32	8	3.16667 3.2 | 6 ratings

Comments and Ratings Matching Ayman's Watch List			1-5 of 11
Date	File	Comment by	Comments	Rating
23 Dec 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	Billal merabti	the code of 'connected' function is not correct. if you want to use this code you have to correct it (it is simple to do). but i think that the code is verry simple to understand and to use. an other think, we can use the matlab function max(PV,3)' in the place of "fysalida.m" thanks	Comment only
15 Oct 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	kheroua mohammed reda	a kadri mourad...es-tu celui que je connais le prof. de geologie a l'ecole des mines de paris...si oui j'aimerais renrer en contact...!	Comment only
15 Oct 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	kheroua mohalled reda	je voudrais savoir	Comment only
31 May 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	Lai Wei	I think the code is not correct. If we get w=[0 1 0 0;1 0 1 0;0 1 0 0;0 1 0 0], the connected will also be 1.	Comment only
11 May 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	kadri mourad		3