A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common “forward” coding of wavelet trees from the highest level (lowest resolution), th...
Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja ...
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
Abstract—Distributed interactive applications have become increasingly popular, making it important to address their communication needs, where one of the needs is group communic...
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...