Browsing CS Technical Reports by Title
Now showing items 856-875 of 1766
-
Machine Learning via Mathematical Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Malware Normalization
(University of Wisconsin-Madison Department of Computer Sciences, 2005)Malware is code designed for a malicious purpose, such as obtaining root privilege on a host. A malware detector identifies malware and thus prevents it from adversely affecting a host. In order to evade detection by ... -
Man-Machine Integration in a Lexical Processing System
(University of Wisconsin-Madison Department of Computer Sciences, 1976)LEXICO is a computer system that may be used for dictionary construction and other areas of lexical analysis. Textual material may be stored, edited, concorded, and lemmatized to assist the researcher. The system is designed ... -
Manageable Storage via Adaptation in WiND
(University of Wisconsin-Madison Department of Computer Sciences, 2000) -
Managing Memory to Meet Multiclass Workload Response Time Goals
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Managing the Chip Design Database
(University of Wisconsin-Madison Department of Computer Sciences, 1983) -
MapReduce for the Cell B.E. Architecture
(University of Wisconsin-Madison Department of Computer Sciences, 2007)MapReduce is a simple and flexible parallel programming model proposed by Google for large scale data processing in a distributed computing environment [4]. In this paper, we present a design and implementation of ... -
Markov Information Propagation for Texture Synthesis
(University of Wisconsin-Madison Department of Computer Sciences, 2002) -
Massively Parallel Solution of Quadratic Programs Via Successive Overrelaxation
(University of Wisconsin-Madison Department of Computer Sciences, 1991) -
Master/Slave Speculative Parallelization with Distilled Programs
(University of Wisconsin-Madison Department of Computer Sciences, 2002) -
Mathematical Programming in Neural Networks
(University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Maximal-Munch Tokenization in Linear Time
(University of Wisconsin-Madison Department of Computer Sciences, 1997) -
The Maximum K-Colorable Subgraph Problem
(University of Wisconsin-Madison Department of Computer Sciences, 1989)For a given graph, the Maximum k-Colorable Subgraph Problem is the problem of determining the largest set of vertices of the graph that can be colored using k distinct colors such that adjacent vertices, if colored, are ... -
Maximum Processing Rates of Memory Bound Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1979) -
Mazu: Taming Latency in Software Defined Networks
(2014-04-30)Timely interaction between an SDN controller and switches is crucial to many SDN management applications such as fast rerouting during link or switch failure and reactive path setup for latency-sensitive flows. However, ... -
MCDASH: Refinement-Based Property Verification for Machine Code
(University of Wisconsin-Madison Department of Computer Sciences, 2009)This paper presents MCDASH, a refinement-based model checker for machine code. While model checkers such as SLAM, BLAST, and DASH have each made significant contributions in the field of verification/flaw-detection, ... -
MCPLIB: A Collection of Nonlinear Mixed Complementarity Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1994) -
A Mean-Value Performance Analysis of a New Multiprocessor Architecture
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Measurement and Prediction of Contention in Multiprocessor Operating Systems with Scientific Application Workloads
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Measuring Distributed Programs: A Hierarchical and Interactive Approach
(University of Wisconsin-Madison Department of Computer Sciences, 1985)