: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartk...
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
This is a framework for resource allocation in a heterogeneous system composed of various access networks, for instance Third Generation wireless networks (3G) and WLAN, in the pre...
We consider the origin of the high-dimensional input space as a variable which can be optimized before or during neuronal learning. This set of variables acts as a translation on ...
Daniel Remondini, Nathan Intrator, Gastone C. Cast...
We present an experimental study of automatic camera control in the performance of collaborative remote repair tasks using video-mediated communication. Twelve pairs of participan...
Abhishek Ranjan, Jeremy P. Birnholtz, Ravin Balakr...