Browsing CS Technical Reports by Title
Now showing items 567586 of 1766

Face Cyclographs for Recognition
(University of WisconsinMadison Department of Computer Sciences, 2006)A new representation of faces, called face cyclographs, is introduced for face recognition that incorporates all views of a rotating face into a single image. The main motivation for this representation comes from recent ... 
Face, Expression, and Iris Recognition Using LearningBased Approaches
(University of WisconsinMadison Department of Computer Sciences, 2006)This thesis investigates the problem of facial image analysis. Human faces contain a lot of information that is useful for many applications. For instance, the face and iris are important biometric features for security ... 
Factor Refinement
(University of WisconsinMadison Department of Computer Sciences, 1989) 
Factoring Polynomials Using Fewer Random Bits
(University of WisconsinMadison Department of Computer Sciences, 1988) 
Factorization Theorems for Univariate Splines on Regular Grids
(University of WisconsinMadison Department of Computer Sciences, 1989) 
A Fair, Robust DQDB Protocol with Preemptive Priorities
(University of WisconsinMadison Department of Computer Sciences, 1993) 
Fairness Analysis of Multiprocessor Bus Arbitration Protocols
(University of WisconsinMadison Department of Computer Sciences, 1988) 
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal With Probability One
(University of WisconsinMadison Department of Computer Sciences, 1980) 
Fast Algorithms for NPHard Problems Which Are Optimal or NearOptimal with Probability One
(University of WisconsinMadison Department of Computer Sciences, 1979)We present fast algorithms for six NPhard problems. These algorithms are shown to be optimal or nearoptimal with probability one (i.e., almost surely). First we design an algorithm for the Euclidean traveling salesman ... 
Fast Checkpoint/Recovery to Support KiloInstruction Speculation and Hardware Fault Tolerance
(University of WisconsinMadison Department of Computer Sciences, 2000) 
Fast Control Plane Analysis Using an Abstract Representation
(20160819)Networks employ complex, and hence errorprone, routing control plane configurations. In many cases, the impact of errors manifests only under failures and leads to devastating effects. Thus, it is important to proactively ... 
Fast FiniteDifference Solution of Biharmonic Problems
(University of WisconsinMadison Department of Computer Sciences, 1970) 
Fast Solvers for Finite Difference Approximations for the Stokes and NavierStokes Equations
(University of WisconsinMadison Department of Computer Sciences, 1991) 
FastCache: A New Abstraction for Memory System Simulation
(University of WisconsinMadison Department of Computer Sciences, 1994) 
Feasible MultiComputer Architectures, Given 3Dimensional Stacked Wafers
(University of WisconsinMadison Department of Computer Sciences, 1983) 
Feature Extraction Algorithms
(University of WisconsinMadison Department of Computer Sciences, 1970)This paper describes methods for extracting patternsynthesizing features. A set of patterns is expressed as a Boolean matrix, allowing the problem of feature extraction to be viewed as one of factoring this matrix. ... 
Filter Joins: CostBased Optimization for Magic Sets
(University of WisconsinMadison Department of Computer Sciences, 1995) 
Finding Bottlenecks in Large Scale Parallel Programs
(University of WisconsinMadison Department of Computer Sciences, 1994) 
Finding Witnesses Using Fewer Random Bits
(University of WisconsinMadison Department of Computer Sciences, 1987) 
FineGrain Access Control for Distributed Shared Memory
(University of WisconsinMadison Department of Computer Sciences, 1994)