Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier...
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nas...
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
General-purpose computing on graphics processing units (GPGPU) has recently gained considerable attention in various domains such as bioinformatics, databases and distributed comp...
Abdullah Gharaibeh, Samer Al-Kiswany, Matei Ripean...