Search Results for "cp/m"

LaNet-vi provides images of large scale networks on a two-dimensional layout. The algorithm is based on the k-core and k-dense (m-core) decomposition. For more details see http://lanet-vi.fi.uba.ar.

...A description of Nuclei's functionality and results obtained using its search method was published in Nuclear Instruments and Methods in Physics Research, Section A: M. Nagl, et al., NIM A 726 (2013), 17-30 [doi:10.1016/j.nima.2013.05.045] ------------------------- © 2012-2013, Matthias Nagl, II. Physikalisches Institut, Georg-August-Universität Göttingen http://physik2.uni-goettingen.de/research/2_hofs -------------------------

...The algorithm for calculating GSH is called Pluton and the present Java realization is based on two articles. "Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. ...

Ump is an easy to use math program that plots in both 2D and 3D. Ump also handles complex numbers, matrices, arbitrary sized integers and ratios.