Index Catalog // ScholarsArchive@OSU

Creator:: Borradaile, Glencora, Klein, Philip N., and Mathieu, Claire
Abstract:: We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ε > 0 and given n terminals in the plane with connection requests between some pairs of terminals, our scheme finds a (1 + ε) approximation to the minimum-length...
Resource Type:: Article
Full Text:: Association for Computing Machinery (ACM) Accepted Manuscript http://cdss.library.oregonstate.edu/sa

Creator:: Borradaile, Glencora, Sankowski, Piotr, and Wulff-Nilsen, Christian
Abstract:: For an undirected n-vertex planar graph G with non-negative edge-weights, we consider the following type of query: given two vertices s and t in G, what is the weight of a min st-cut in G? We show how to answer such queries in constant time with O(n log⁴ n) preprocessing...
Resource Type:: Article
Full Text:: 10.1145/2684068 Association for Computing Machinery (ACM) Accepted Manuscript http

Creator:: Zhang, Hui, Dunn, Jon, Cowan, Will, Durbin, Mike, and Wheeler, Brian
Abstract:: This article was first presented as a conference paper in June 2012 at the 12th ACM/IEEE-CS joint conference on Digital Libraries, Washington, D.C., U.S.A.
Resource Type:: Conference Proceeding
Full Text:: /2232817.2232924 Association for Computing Machinery (ACM) Accepted Manuscript http

Creator:: Chen, Sheng, Erwig, Martin, and Walkingshaw, Eric
Abstract:: Through the use of conditional compilation and related tools, many software projects can be used to generate a huge number of related programs. The problem of typing such variational software is difficult. The brute-force strategy of generating all variants and typing each one individually is (1) usually infeasible for efficiency...
Resource Type:: Article
Full Text:: ), 1. doi:10.1145/2518190 10.1145/2518190 Association for Computing Machinery Accepted Manuscript

Creator:: Fleming, Scott D., Scaffidi, Chris, Piorkowski, David, Burnett, Margaret, Bellamy, Rachel, Lawrance, Joseph, and Kwan, Irwin
Abstract:: Theories of human behavior are an important but largely untapped resource for software engineering research. They facilitate understanding of human developers’ needs and activities, and thus can serve as a valuable resource to researchers designing software engineering tools. Furthermore, theories abstract beyond specific methods and tools to fundamental principles that...
Resource Type:: Article
Full Text:: hassle with IEEE. There might be other changes. Check the ACM website for the final version of the paper

Creator:: Chen, Yang, Groce, Alex, Zhang, Chaoqiang, Wong, Weng-Keen, Fern, Xiaoli, Eide, Eric, and Regehr, John
Abstract:: Aggressive random testing tools (“fuzzers”) are impressively effective at finding compiler bugs. For example, a single test-case generator has resulted in more than 1,700 bugs reported for a single JavaScript engine. However, fuzzers can be frustrating to use: they indiscriminately and repeatedly find bugs that may not be severe enough...
Resource Type:: Article
Full Text:: of the trusted computing base for many systems. A code-generation error in a compiler for a critical

Creator:: Jung, Seikyung, Harris, Kevin, Webster, Janet G., and Herlocker, Jonathan L.
Abstract:: Today's university library has many digitally accessible resources, both indexes to content and considerable original content. Using off-the-shelf search technology provides a single point of access into library resources, but we have found that such full-text indexing technology is not entirely satisfactory for library searching. In response to this, we...
Resource Type:: Conference Proceeding
Full Text:: Collaborative Filtering for Efficient Document Search. The 2004 IEEE/WIC/ACM Joint Conference on Web

ScholarsArchive@OSU