Browsing Department of Computer Sciences, UW-Madison by Title
Now showing items 1389-1408 of 1919
-
A Primer on Image Manipulation Using a High Resolution Color Display Terminal
(University of Wisconsin-Madison Department of Computer Sciences, 1982) -
Principles of Static Clustering for Object Oriented Databases
(University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Prioritize Winter Crash Severity Influencing Factors in US Midwestern for Autonomous Vehicle
(2020-02-28)Adverse weather conditions in winter have significant impacts on crash occurrences and risks. Human drivers can adjust driving styles based on the context information of the surrounding traffic and environments. Similar ... -
Priority in DBMS Resource Scheduling
(University of Wisconsin-Madison Department of Computer Sciences, 1989)In this paper, we address the problem of priority scheduling in a database management system. We start by investigating the architectural consequences of adding priority to a DBMS. Specific priority-based schemes are ... -
Priority Scheduling in Database Management Systems
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Priority Scheduling in Tandem Queues
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Priority-Hints: An Algorithm for Priority-Based Buffer Management
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
PRISM: A Laboratory for Research in Future High-Performance Parallel Computing
(University of Wisconsin-Madison Department of Computer Sciences, 1991) -
Privacy Skyline: Privacy with Multidimensional Adversarial Knowledge
(University of Wisconsin-Madison Department of Computer Sciences, 2007)Privacy is an important issue in data publishing. Many organizations distribute non-aggregate personal data for research, and they must take steps to ensure that an adversary cannot predict sensitive information pertaining ... -
Privacy-Preserving Classification of Horizontally Partitioned Data via Random Kernels
(2007)We propose a novel privacy-preserving nonlinear support vector machine (SVM) classifier for a data matrix A whose columns represent input space features and whose individual rows are divided into groups of rows. Each ... -
Privacy-Preserving Classification of Vertically Partitioned Data via Random Kernels
(2007)We propose a novel privacy-preserving support vector machine (SVM) classifier for a data matrix A whose input feature columns are divided into groups belonging to different entities. Each entity is unwilling to share its ... -
Privacy-Preserving Horizontally Partitioned Linear Programs
(2010)We propose a simple privacy-preserving reformulation of a linear program whose equality constraint matrix is partitioned into groups of rows. Each group of matrix rows and its corresponding right hand side vector are ... -
Privacy-Preserving Linear and Nonlinear Approximation via Linear Programming
(2011)We propose a novel privacy-preserving random kernel approximation based on a data matrix A ? Rm�n whose rows are divided into privately owned blocks. Each block of rows belongs to a different entity that is unwilling to ... -
Privacy-Preserving Random Kernel Classification of Checkerboard Partitioned Data
(2008)We propose a privacy-preserving support vector machine (SVM) classifier for a data matrix A whose input feature columns as well as individual data point rows are divided into groups belonging to different entities. Each ... -
Probabilistic Directed Writebacks for Exclusive Caches
(2016-02-26)Energy is an increasingly important consideration in memory system design. Although caches can save energy in several ways, such as by decreasing execution time and reducing the number of main memory accesses, they also ... -
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 1984) -
Probabilistic Methods for Interpreting Electron-Density Maps
(University of Wisconsin-Madison Department of Computer Sciences, 2007)With recent advances in structural genomics, there has been considerable interest in the rapid determination of protein structures in a high-throughput setting. One bottleneck in this process arises in protein crystallography, ... -
Probabilistic Optimization of Top N Queries
(University of Wisconsin-Madison Department of Computer Sciences, 1999) -
A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine
(University of Wisconsin-Madison Department of Computer Sciences, 1984) -
Probability of Unique Integer Solution to a System of Linear Equations
(2009)We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer: x ? {?1,1}n. We achieve this by reformulating ...