Search
Now showing items 1-7 of 7
Three-fast-searchable graphs
(Elsevier Science Bv, 2013)
In the edge searching problem searchers move from vertex to vertex in a graph to capture an invisible fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which at every ...
SPINAL: scalable protein interaction network alignment
(Oxford University Press, 2013)
Motivation: Given protein-protein interaction (PPI) networks of a pair of species a pairwise global alignment corresponds to a one-to-one mapping between their proteins. Based on the presupposition that such a mapping ...
Exploiting heterogeneous parallelism with the Heterogeneous Programming Library
(Academic Press Inc Elsevier Science, 2013)
While recognition of the advantages of heterogeneous computing is steadily growing the issues of programmability and portability hinder its exploitation. The introduction of the OpenCL standard was a major step forward in ...
Competitive intelligence and information technology adoption of SMEs in Turkey: Diagnosing current performance and identifying barriers
(Halmstad University, 2013)
The need for SMEs to behave in a more concise and coherent competitive fashion is well recognised. This study reports on an empirical study of SMEs in Turkey. Their responses were applied to a behavioural and information ...
CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways
(Oxford University Press, 2013)
Motivation: Given a pair of metabolic pathways an alignment of the pathways corresponds to a mapping between similar substructures of the pair. Successful alignments may provide useful applications in phylogenetic tree ...
Navigation of non-communicating autonomous mobile robots with guaranteed connectivity
(Cambridge Univ Press, 2013)
We consider the connectivity of autonomous mobile robots. The robots navigate using simple local steering rules without requiring explicit communication among themselves. We show that using only position information of ...
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups
(Elsevier Science Bv, 2013)
In this article we introduce the concept of (p alpha)-switching trees and use it to provide sufficient conditions on the abelian groups G and H for when CAY (G x H