Browsing CS Technical Reports by Title
Now showing items 130-149 of 1772
-
B-Splines Without Divided Differences
(University of Wisconsin-Madison Department of Computer Sciences, 1985) -
Backtracking Algorithmic Complexity Attacks Against a NIDS
(University of Wisconsin-Madison Department of Computer Sciences, 2006)Network Intrusion Detection Systems (NIDS) have become crucial to securing modern networks. To be effective, a NIDS must be able to counter evasion attempts and operate at or near wire-speed. Failure to do so allows ... -
Badger: An Entropy-Based Web Search Clustering System with Randomization and Voting
(University of Wisconsin-Madison Department of Computer Sciences, 2005)We have implemented and improved an entropy-based clustering algorithm. In addition to utilizing entropy as a clustering mechanism, our algorithm, Badger, uses randomization and a voting scheme to improve the quality of ... -
Balanced Solution to a Class of Generalized Set Covering
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Balancing Capacity and Latency in CMP Caches
(University of Wisconsin-Madison Department of Computer Sciences, 2006)The large working sets of conmercial and scientific workloads stress the L2 caches of Chip Multiprocessors (CMPs). Some CMPs use a shared L2 cache, to maximize the on-chip cache capacity and minimize misses. Others use ... -
Bandwidth Skimming: A Technique for Cost-Effective Video-on-Demand
(University of Wisconsin-Madison Department of Computer Sciences, 1999) -
Barrier Decomposition for the Parallel Optimization of Block-Angular Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Base Set Strategy for Solving Linearly Constrained Convex Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1983) -
Batch Scheduling in Parallel Database Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
A Bayesian model for image sense ambiguity in pictorial communication systems
(University of Wisconsin-Madison Department of Computer Sciences, 2011)Pictorial communication systems use synthesized pictures, rather than text, to communicate with users. Because such systems depend on images to convey meanings, it is critical to understand how a human user perceives ... -
BCE: Extracting Botnet Commands from Bot Executables
(University of Wisconsin-Madison Department of Computer Sciences, 2010)Botnets are a major threat to the security of computer systems and the Internet. An increasing number of individual Internet sites have been compromised by attacks from all across the world to become part of various kinds ... -
Benchmarking Database Systems - A Systematic Approach
(University of Wisconsin-Madison Department of Computer Sciences, 1983) -
Benchmarking the MRNet Distributed Tool Infrastructure: Lessons Learned
(University of Wisconsin-Madison Department of Computer Sciences, 2004)MRNet is an infrastructure that provides scalable multicast and data aggregation functionality for distributed tools. While evaluating MRNet?s performance and scalability, we learned several important lessons about ... -
Bermuda-An Architectural Perspective on Interfacing Prolog to a Database Machine
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
Better Slicing of Programs with Jumps and Switches
(University of Wisconsin-Madison Department of Computer Sciences, 2001) -
BIBCON: A 3600 Program for Producing Concordances to Prose, Poetry and Bibliographic References
(University of Wisconsin-Madison Department of Computer Sciences, 1969) -
BIBCON: An 1108 Program for Producing Concordances to Prose, Poetry and Bibliographic References
(University of Wisconsin-Madison Department of Computer Sciences, 1971) -
Bibliography on Proving the Correctness of Computer Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1969) -
Bibliography on Proving the Correctness of Computer Programs - Addition No. 1
(University of Wisconsin-Madison Department of Computer Sciences, 1970)The continued research activity in proving the correctness of computer programs and the widespread interest in my previous program proving bibliography (London 1970a) encourage me to compile these additional updating ... -
Bilateral Algorithms for Symbolic Abstraction
(University of Wisconsin-Madison Department of Computer Sciences, 2012-03-28)Given a concrete domain C, a concrete operation tau: C -> C, and an abstract domain A, a fundamental problem in abstract interpretation is to find the best abstract transformer tau#: A -> A that over-approximates tau. ...