This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...
Background: Protein-protein docking for proteins with large conformational changes was analyzed by using interaction fingerprints, one of the scales for measuring similarities amo...
Interest in Grid computing has grown significantly over the past five years. Management of distributed cluster resources is a key issue in Grid computing. Central to management ...