In this paper we depart from a set of simple assumptions regarding the behavior of a pool of customers associated with an enterprise’s contact center. We assume that the pool of...
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Background: With the growing amount of biomedical data available in public databases it has become increasingly important to annotate data in a consistent way in order to allow ea...
Background: Document classification is a wide-spread problem with many applications, from organizing search engine snippets to spam filtering. We previously described Textpresso, ...
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...