Browsing CS Technical Reports by Title
Now showing items 790-809 of 1766
-
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 ... -
Learning in Mathematically-Based Domains: Understanding and Generalizing Obstacle Cancellations
(University of Wisconsin-Madison Department of Computer Sciences, 1989)Mathematical reasoning provides the basis for problem solving and learning in many complex domains. A model for applying explanation-based learning in mathematically-based domains is presented, and an implemented learning ... -
Learning Structures to Represent Verb Meaning
(University of Wisconsin-Madison Department of Computer Sciences, 1977)A program that learns structures that represent verb meaning is described. Inputs are combinations of surface sentences and environment snapshots. The program learns to associate surface verbs with conceptual dependency ... -
Learning to Use Contextual Patterns in Language Processing
(University of Wisconsin-Madison Department of Computer Sciences, 1972)The research described in this thesis concerns the application of pattern recognition and learning to natural language processing. Using the techniques of learning and pattern recognition, a program has been written to ... -
Least Norm Solution of Non-Monotone Linear Complementarity Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
The Least Solution for the Polynomial Interpolation Problem
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
A Least-Cost Error Corrector for LR(1)-Based Parsers
(University of Wisconsin-Madison Department of Computer Sciences, 1978)An error corrector working with LR(1) parsers and variations such as SLR(1) and LALR(1) is studied. The corrector is able to correct and parse any input string. Upon detection of a syntax error, it operates by deleting ... -
Least-Cost Syntactic Error Repair Using Extended Right Context
(University of Wisconsin-Madison Department of Computer Sciences, 1983)