Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our result...
Susan H. Rodger, Eric Wiebe, Kyung Min Lee, Chris ...
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
d abstractions for high-performance remote data access, mechanisms for scalable data replication, cataloging with rich semantic and syntactic information, data discovery, distribut...
David E. Bernholdt, Shishir Bharathi, David Brown,...
Over the past decade, the notion of multi-modal access to technology has moved from the realms of science fiction to reality. It is not now unthinkable to communicate with a machi...