We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Abstract. The purpose of this work is to demonstrate that it is possible to cluster contact maps for pairs of alpha helices such that each of the clusters corresponds to a group of...
In this paper, we model large support vector machines (SVMs) by smaller networks in order to decrease the computational cost. The key idea is to generate additional training patte...
Pramod Lakshmi Narasimha, Sanjeev S. Malalur, Mich...
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
A novel framework called 2D Fisher Discriminant Analysis
(2D-FDA) is proposed to deal with the Small Sample
Size (SSS) problem in conventional One-Dimensional Linear
Discriminan...
Hui Kong, Lei Wang, Eam Khwang Teoh, Jian-Gang Wan...