In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Large repositories of source code create new challenges and opportunities for statistical machine learning. Here we first develop Sourcerer, an infrastructure for the automated c...
Erik Linstead, Paul Rigor, Sushil Krishna Bajracha...
Systems consisting of multiple proxy servers are a popular solution to deal with performance and network resource utilization problems related to the growth of the Web numbers. Af...
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...
The TREC 2003 question answering track contained two tasks, the passages task and the main task. In the passages task, systems returned a single text snippet in response to factoi...