Browsing CS Technical Reports by Title
Now showing items 786-805 of 1769
-
The K-Ary GCD Algorithm
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
The K-Grid Fourier Analysis of Multigrid Type Iterative Methods
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
K-Line Iterative Methods: A Conjugate Gradient Approach
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
Karma: Scalable Deterministic Record-Replay
(University of Wisconsin-Madison Department of Computer Sciences, 2010)Recent research in deterministic record-replayseeks to ease debugging, security, and fault tolerance on otherwise nondeterministic multicore systems. The important challenge of handling shared memory races (that can occur ... -
Kernel Support for the Wisconsin Wind Tunnel
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Knapsack: A Zero-Cycle Memory Hierarchy Component
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
Kolmogorov Complexity, Restricted Nondeterminism and Generalized Spectra
(University of Wisconsin-Madison Department of Computer Sciences, 1989)This paper uses the technique of generalized spectra and expressibility of complexity classes in logic, developed by Fagin and Immerman, to give alternate characterizations of specific subclasses of NP. These characterizations ... -
The $L sup 2$ Discrepancies of the Hammersley and Zaremba Sequences in $0,1 sup 2$ for an Arbitrary Radix
(University of Wisconsin-Madison Department of Computer Sciences, 1973)Useful theoretical formulae are presented for measuring, in a quadratic-mean sense, the extent to which a class of important sequences is imperfectly distributed in the unit square. Previous results of Halton and Zaremba ... -
The L2 Discrepancy of the Roth Sequence in [0,1]2 for an Arbitrary Numbers of Points
(University of Wisconsin-Madison Department of Computer Sciences, 1973) -
A la carte: An Economic Framework for Multi-ISP Service Quality
(University of Wisconsin-Madison Department of Computer Sciences, 2007)Internet quality of service is required by many applications such as interactive voice and video that could fuel the further growth of the network, but it is not widely available to end-users. While ISPs are providing QoS ... -
Lamort Clocks: Reasoning About Shared Memory Correctness
(University of Wisconsin-Madison Department of Computer Sciences, 1998) -
A Language for Parallel Processing of Arrays, Embedded in PASCAL
(University of Wisconsin-Madison Department of Computer Sciences, 1979) -
Layers "Recognition Cone" Networks That Pre-Process, Classify, and Describe
(University of Wisconsin-Madison Department of Computer Sciences, 1971)This paper gives a brief overview of six types of pattern recognition programs that (1) pre-process, then characterize, (2) pre-process and characterize together, (3) pre-process and characterize into a "recognition cone", ... -
LCM: Memory System Support for Parallel Language Implementation
(University of Wisconsin-Madison Department of Computer Sciences, 1994) -
Learnability of Dynamic Bayesian Networks from Time Series Microarray Data
(University of Wisconsin-Madison Department of Computer Sciences, 2004)Dynamic Bayesian networks (DBNs) are becoming widely used to learn gene regulatory networks from time series microarray data. Careful experimental design is required for data generation, because of the high cost of running ... -
Learning by Pattern Induction
(University of Wisconsin-Madison Department of Computer Sciences, 1978)Human infants are able to accumulate considerable knowledge in their first year of life without having well-developed communications skills. Pattern induction is proposed as a mechanism for accomplishing learning in a ... -
Learning Ensembles of First Order Clauses That Optimize Precision Recall Curves
(University of Wisconsin-Madison Department of Computer Sciences, 2007)Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data, such as biomedical information extraction, citation matching, and learning relationships in social networks. A common way to ... -
Learning Expressive Computational Models of Gene Regulatory Sequences and Responses
(University of Wisconsin-Madison Department of Computer Sciences, 2007)The regulation and responses of genes involve complex systems of relationships between genes, proteins, DNA, and a host of other molecules that are involved in every aspect of cellular activity. I present algorithms ... -
Learning From Instruction and Experience: Methods for Incorporating Procedural Domain Theories Into Knowledge-Based Neural Networks
(University of Wisconsin-Madison Department of Computer Sciences, 1995) -
Learning in a Free Robot
(University of Wisconsin-Madison Department of Computer Sciences, 1977)A "free" robot is one which "pursues happiness" or reward rather than obeying commands. A program for controlling such a robot has been written, and is in the process of being debugged and tested. It is designed to learn ...