Historique: Task1: Seperation of dependent components
Comparaison de la version 27 à la version 35
|
@@ -Lignes: 20-28 changées en +Lignes: 20-46 @@
!!Submission
- Please send submissions by October 31, 2011 to
+ The deadline for submission of results was October 31, 2011 to be sent to
Guido Nolte email: guido.nolte(at)first.fraunhofer.de
- Note that the deadline was extended!
In addition, each participant is asked to provide basic information about his/her algorithm (e.g. a bibliographical reference) .
+
In addition, each participant was asked to provide basic information about his/her algorithm (e.g. a bibliographical reference) . !!Results To see the algorithm details, click the submitter's name. ||Name | City | Total points | Correct detections | False detections |Details A.M. Bianchi | Milano/Italy | -2289 | 701 | 299 | ((S. Hu)) | Hangzhou/China | 252 | 352 | 10 | Click name ((L. Leistritz)) | Jena/Germany | -357 | 773 | 113 | Click name ((V. Vakorin)) | Toronto/Canada | 218 | 278 | 6 | Click name ((M. Wibral)) | Frankfurt/Germany | -247 | 163 |41 |[http://sisec2011.wiki.irisa.fr/tiki-download_wiki_attachment.php?attId=7&page=Task1%3A%20Seperation%20of%20dependent%20components|(pdf)]|| Remark: The total points can be calculated as the number of correct detections minus ten times the number of false detections. |