In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
Payel Ghosh, Sameer Antani, L. Rodney Long, George...
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...