1458 search results - page 131 / 292 » Monads for incremental computing |
113
click to vote
JSCIC
2006
2006
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
15 years 3 months ago
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
115
click to vote
PVLDB
2010
15 years 1 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
171
Voted
ECEASST
2010
15 years 26 days ago
2010
Abstract: An experiment in providing volunteer cloud computing support for automated audits of open source code is described here, along with the supporting theory. Certification a...
104
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Conventional clustering techniques provide a static snapshot of each vector's commitment to every group. With additive datasets, however, existing methods may not be sufficie...
124
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...