When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
Applications that create and consume unstructured data have grown both in scale of storage requirements and complexity of search primitives. We consider two such applications: exha...
Aravindan Raghuveer, Biplob K. Debnath, David Hung...
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...