We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
Software product lines are multiple systems that are developed synergistically in an attempt to exploit scope economies. They are a promising approach to more effectively developi...
Giancarlo Succi, Jason Yip, Eric Liu, Witold Pedry...
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...