15 citations · 28 across the 9 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010★ 3 cited
On the number of solutions of the discretizable molecular distance geometry problem
Leo Liberti, Benoit Masson, Jon Lee +2
The Generalized Discretizable Molecular Distance Geometry Problem is a distance geometry problems that can be solved by a combinatorial algorithm called ``Branch-and-Prune''. It wa…
cs.LG2010★ 3 cited
A New Heuristic for Feature Selection by Consistent Biclustering
Antonio Mucherino, Sonia Cafieri
Given a set of data, biclustering aims at finding simultaneous partitions in biclusters of its samples and of the features which are used for representing the samples. Consistent b…