1102 search results - page 18 / 221 » Generalizing Updates: From Models to Programs |
197
Voted
FOSSACS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
145
Voted
ANOR
2002
15 years 6 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
139
Voted
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
176
Voted
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper, we present a probabilistic formulation of kernel-based tracking methods based upon maximum likelihood estimation. To this end, we view the coordinates for the pixel...
198
Voted
ICFP
2012
ACM
13 years 8 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...