Search
Now showing items 1-10 of 19
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
We present a new decision procedure for detecting property violations
in pushdown models for concurrent programs that use lock-based
synchronization, where each thread's lock operations are properly nested
(a la ...
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 ...
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 ...
Active Learning Literature Survey
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
The key idea behind active learning is that a machine learning algorithm can achieve greater accuracy with fewer labeled training instances if it is allowed to choose the training data from which is learns. An active learner ...
RouteBazaar: An Economic Framework for Flexible Routing
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
The Internet?s routing protocol provides users a single end-to-end route that is not guaranteed to be available or to meet user requirements. Our paper addresses this rigidity using an economically grounded approach that ...
Physically-based Animation Rendering with Markov Chain Monte Carlo
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
Exploring temporal coherence among light transport paths is very important to remove temporally perception-sensitive artifacts in animation rendering. Using the contribution of a light transport path to all frames in an ...
Interprocedural Analysis and the Verification of Concurrent Programs
(University of Wisconsin-Madison Department of Computer Sciences, 2009)
In the modern world, not only is software getting larger and more complex, it is also becoming pervasive in our daily lives. On the one hand, the advent of multi-core processors is pushing software towards becoming more ...