921 search results - page 34 / 185 » Expressing Computational Complexity in Constructive Type The... |
POPL
2003
ACM
14 years 8 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
FGCS
2000
13 years 7 months ago
2000
Computer graphics (CGr) lies in the fundaments of computer aided engineering (CAE). As a result from the fast development in both CGr and CAE, more and more computer aided systems...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
GI
2004
Springer
14 years 1 months ago
2004
Springer
: There is an emerging amount of software for generating and manipulating XML documents. This paper addresses the problem of guaranteeing the validity of dynamically generated XML ...
CSDA
2011
13 years 2 months ago
2011
In this article we consider the statistical inferences of the unknown parameters of a Weibull distribution when the data are Type-I censored. It is well known that the maximum lik...