Sciweavers

1073 search results - page 140 / 215
» Formal Program Development with Approximations
Sort
View
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 9 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
13 years 11 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 7 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
EMMCVPR
2001
Springer
14 years 6 days ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
NIPS
2007
13 years 9 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray