Browsing CS Technical Reports by Title
Now showing items 11511170 of 1769

Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination
(University of WisconsinMadison Department of Computer Sciences, 2008)Many past systems have explored how to eliminate redundant transfers from network links and improve network efficiency. Several of these systems operate at the application layer, while the more recent systems operate on ... 
Packet Train Model: Optimizing Network Data Transfer Performance
(University of WisconsinMadison Department of Computer Sciences, 1989)Network transmission bandwidth of 100 megabits per second is now available for LANs and bandwidth over gigabits per second will soon be available for WANs. A growing number of communication applications demand the support ... 
Packing Multiway Cuts in Capacitated Graphs
(University of WisconsinMadison Department of Computer Sciences, 2008)We consider the following ?multiway cut packing? problem in undirected graphs: we are given a graph G = (V,E) and k commodities, each corresponding to a set of terminals located at different vertices in the graph; our goal ... 
Paging Tradeoffs in DistributedSharedMemory Multiprocessors
(University of WisconsinMadison Department of Computer Sciences, 1994) 
The Paradyn Parallel Performance Measurement Tools
(University of WisconsinMadison Department of Computer Sciences, 1994) 
The Paradyn Parallel Performance Tools and PVM
(University of WisconsinMadison Department of Computer Sciences, 1994) 
A Parallel Algorithm for Generalized Networks
(University of WisconsinMadison Department of Computer Sciences, 1986) 
A Parallel Algorithm for Minimal Cost Network Flow Problems
(University of WisconsinMadison Department of Computer Sciences, 1988) 
A Parallel Algorithm for Multiview Image Denoising
(20140523)In this paper, we propose to improve the denoising performance by exploiting the redundancy provided by the multiple views. Here, we review the rich literature on image denoising methods. Zhang et. al. in [1] conjecture ... 
Parallel Algorithms and Secondary Storage Methods for X'X
(University of WisconsinMadison Department of Computer Sciences, 1984) 
Parallel Algorithms for a Class of Convex Optimization Problems
(University of WisconsinMadison Department of Computer Sciences, 1987) 
Parallel Algorithms for the Execution of Relational Database Operations
(University of WisconsinMadison Department of Computer Sciences, 1980) 
Parallel AlphaBeta Search on Arachne
(University of WisconsinMadison Department of Computer Sciences, 1980) 
Parallel and Serial Solution of LargeScale Linear Complementarity Problems
(University of WisconsinMadison Department of Computer Sciences, 1987) 
Parallel ArcAllocation Algorithms for Optimizing Generalized Networks
(University of WisconsinMadison Department of Computer Sciences, 1989)Two parallel sharedmemory algorithms are presented for the optimization of generalized networks. These algorithms are based on the allocation of arcrelated operations in the (generalized) network simplex method. One ... 
A Parallel Asynchronous Successive Overrelaxation Algorithm for Solving the Linear Complementarity Problem
(University of WisconsinMadison Department of Computer Sciences, 1987) 
Parallel Constraint Distribution
(University of WisconsinMadison Department of Computer Sciences, 1990) 
Parallel Constraint Distribution in Convex Quadratic Programming
(University of WisconsinMadison Department of Computer Sciences, 1991) 
Parallel Database Systems: The Future of High Performance Database Processing
(University of WisconsinMadison Department of Computer Sciences, 1992) 
Parallel Depth First Search in $K sub {3,3}free$ Graphs and $K sub 5free$ Graphs
(University of WisconsinMadison Department of Computer Sciences, 1991)