Search
Now showing items 21-30 of 238
Building Cheap and Large CAMs Using BufferHash
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
We show how to build cheap and large CAMs, or CLAMs, using flash memory. These CLAMs are targeted at an emerging class of networking applications that require massive indexes running into a hundred GB or more, with items ...
On the Effectiveness of Pre-Acceptance Spam Filtering
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
Modern SMTP servers apply a variety of mechanisms to stem the volume of spam delivered to users. These techniques can be broadly classified into two categories: preacceptance approaches, which apply prior to a message ...
To CMP or not to CMP: Analyzing Packet Classification on Modern and Traditional Network Processors
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
Packet classification is a central component of modern network
functionality, yet satisfactory memory usage and overall performance
remains an elusive challenge at the highest speeds. The recent
emergence of chip ...
The Relationship Between Precision-Recall and ROC Curves
(University of Wisconsin-Madison Department of Computer Sciences, 2006)
Receiver Operator Characteristic (ROC) curves and Precision-Recall (PR) curves are commonly used to present results for binary decision problems in machine learning. When the class distribution is close to being uniform, ...
Relational Transfer in Reinforcement Learning
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
Transfer learning is an inherent aspect of human learning. When humans learn to perform a task, we rarely start from scratch. Instead, we recall relevant knowledge from previous learning experiences and apply that knowledge ...
Flexible Lookup Modules for Rapid Deployment of New Protocols in High-speed Routers
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
New protocols for the data link and network layer are being proposed to address limitations of current protocols in terms of scalability, security, and manageability. High speed routers and switches that would need to ...
BTrace: Path Optimization for Debugging
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow graph that touches the maximum number of these ...
Semi-Supervised Learning Literature Survey
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
We review some of the literature on semi-supervised learning in this paper. Traditional classifiers need labeled data (feature / label pairs) to train. Labeled instances however are often difficult, expensive, or time ...
A Loop-Aware Search Strategy for Automated Performance Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
Automated online search is a powerful technique for performance diagnosis. Such a search can change the types of experiments it performs while the program is running, making decisions based on live performance data. Previous ...
Aggregate Sharing in Stream Databases
(University of Wisconsin-Madison Department of Computer Sciences, 2005)
We consider the problem of handling aggregate computations in a scalable fashion in stream databases. The queries of interest are sliding-window aggregate queries over a single data stream. In the na�ve approach for this ...