171 search results - page 15 / 35 » Finger trees: a simple general-purpose data structure |
104
Voted
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
126
Voted
AUSAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
POPL
2012
ACM
13 years 9 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
143
Voted
PEPM
2011
ACM
14 years 4 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
133
click to vote
SOFSEM
2000
Springer
15 years 5 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...