We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
The University of Maryland Researchers participated in both the Arabic-English Cross Language Information Retrieval (CLIR) and Video tracks of TREC-10. In the CLIR track, our goal...
Kareem Darwish, David S. Doermann, Ryan C. Jones, ...
This paper describes an effort to rapidly develop language resources and component technology to support searching Cebuano news stories using English queries. Results from the fi...
Douglas W. Oard, David S. Doermann, Bonnie J. Dorr...
We propose two extensions to the SQL grant/revoke security model. In SQL, grants are unconditional, so the grantor must simply trust the recipient's discretion. We allow a gr...
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...