We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
In this essay, I examine differences between individual and social play and, in particular, the differences between individual and social play within digital media forms designed ...
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...