CNR

#	Item
971	Simplessi Un k simplesso è definito come la combinazione convessa di k+1 punti non linearmente dipendenti Fondamenti di Add to Reading List Source URL: vcg.isti.cnr.it Language: English - Date: 2005-09-21 12:03:28
972	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2015-01-09 05:13:48
973	Submodular Function Minimization Satoru Iwata (University of Tokyo) Submodular Function Minimization Add to Reading List Source URL: www.iasi.cnr.it Language: English - Date: 2013-12-05 05:31:59
974	Fondamenti di Grafica Tridimensionale Paolo Cignoni http://vcg.isti.cnr.it/~cignoni Add to Reading List Source URL: vcg.isti.cnr.it Language: English - Date: 2006-12-05 10:03:18
975	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2014-02-25 02:38:05
976	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2015-01-26 10:57:09
977	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2013-01-21 05:15:46
978	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2013-03-01 06:01:44
979	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2015-01-28 06:33:33
980	PDF Document Add to Reading List Source URL: bandi.urp.cnr.it - Date: 2014-02-25 02:39:43