We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless ma...
Trigram language models are compressed using a Golomb coding method inspired by the original Unix spell program. Compression methods trade off space, time and accuracy (loss). The...
: This paper describes a long-terra project to install socially interactive, autonomousmobile robots in public spaces. We have deployed four robots over the last three years, accum...