1458 search results - page 15 / 292 » Monads for incremental computing |
187
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
186
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
224
click to vote
AOSD
2012
ACM
14 years 2 months ago
2012
ACM
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
183
Voted
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
165
click to vote
TLCA
2005
Springer
16 years 5 days ago
2005
Springer
We give a monadic semantics in the category of FM-cpos to a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data an...