The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
— Queueing theory is generally known as the theory to study the performance of queues. In this paper, we are interested in another aspect of queueing theory, the theory to constr...
Cheng-Shang Chang, Yi-Ting Chen, Jay Cheng, Duan-S...
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...