1458 search results - page 125 / 292 » Monads for incremental computing |
146
Voted
SIGGRAPH
1993
ACM
15 years 7 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
144
Voted
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
141
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
356
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
131
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...