Browsing by Title
Now showing items 19297-19316 of 30357
-
On the Adequacy of Program Dependence Graphs for Representing Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
On the Algebraic Properties of Program Integration
(University of Wisconsin-Madison Department of Computer Sciences, 1989) -
On the applicability of the Ivantsov growth equation
(American Institute of Physics, 1997) -
On the Approximate Minimization of Functionals
(University of Wisconsin-Madison Department of Computer Sciences, 1968) -
On the Banks of the Ganges
(Center for South Asia, University of Wisconsin–Madison, 2001) -
On the Cause of the Variation in Tissue-Maximum Ratio Values with Source-To-Detector Distance
(American Institute of Physics, 1993) -
On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
On the Complexity of Grammar and Related Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1975) -
On the Complexity of Reachability and Motion Planning Questions
(University of Wisconsin-Madison Department of Computer Sciences, 1985) -
On the Complexity of the Policy Interation Algorithm for Stochastic Games
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
On the Computation of Rigorous Bounds for the Solutions of Linear Integral Equations With the Aid of Interval Arithmetic
(University of Wisconsin-Madison Department of Computer Sciences, 1969)A method is given for approximately solving linear Fredholm integral equations of the second klnd with non-negative kernels. The basis of the method is the construction of piecewise-polynomial degenerate kernels which ... -
On the Computational Complexity of Incremental Algorithms
(University of Wisconsin-Madison Department of Computer Sciences, 1991) -
On the Convergence of a Numerical Method for Optimal Control Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1968) -
On the Convergence of Algorithms with Restart
(University of Wisconsin-Madison Department of Computer Sciences, 1974)Global convergence properties are established for a class of point-to-set mathematical programming algorithms commonly termed "restart" methods. Well-known algorithms in this class include the "restart" versions of the ... -
On the convergence of the CORDIC adaptive lattice filtering (CALF) algorithm
(IEEE, Piscataway, NJ, USA, 1998) -
On the Convolution of a Box Spline with a Compactly Supported Distribution: Linear Independence for the Integer Translates
(University of Wisconsin-Madison Department of Computer Sciences, 1989)The problem of linear independence of the integer translates of ?????where ? ?is a compactly supported distribution and ? is an exponential box spline, is considered in this paper. The main result relates the linear ... -
On the Convolution of a Box Spline with a Compactly Supported Distribution: The Exponential-Polynomials in the Linear Span
(University of Wisconsin-Madison Department of Computer Sciences, 1989) -
On the Design and Use of Internet Sinks for Network Abuse Monitoring
(University of Wisconsin-Madison Department of Computer Sciences, 2004)Network abuse monitoring (eg., for intrusions and denial of service attacks) is an important component in security architecture. Monitoring unused IP addresses offers opportunities to significantly improve perspective on ...