The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Multimedia communication is a part of everyday life and its appearance in computer applications is increasing in frequency and diversity. Intelligent or knowledge based computer su...
Mark T. Maybury, Oliviero Stock, Wolfgang Wahlster
Abstract-- This paper describes a novel method for creating surface models of multi-material components using dual energy computed tomography (DECT). The application scenario is me...
Christoph Heinzl, Johann Kastner, Eduard Grölle...
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
Collective behavior involving distally separate regions in a protein is known to widely affect its function. In this paper, we present an online approach to study and characterize ...
Arvind Ramanathan, Pratul K. Agarwal, Maria Kurnik...