We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
The continuing soar in popularity when it comes to standardized information systems sold en masse under the labelling of Enterprise Resource Planning (ERP) Systems is somewhat kep...
Johan Magnusson, Andreas Nilsson, Fredrik Carlsson
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
—Popular online services such as social networks, e-commerce and bidding are routinely hosted in large-scale data centers. Group communication systems (e.g., multicast) and distr...
Karthik Nagaraj, Hitesh Khandelwal, Charles Edwin ...
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape mo...