1805 search results - page 61 / 361 » Functional programming with structured graphs |
ICALP
1990
Springer
14 years 2 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
CPHYSICS
2006
13 years 10 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
MST
2007
13 years 10 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
PEPM
2004
ACM
14 years 3 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
ESOP
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...