2543 search results - page 136 / 509 » Optimal Ordered Problem Solver |
114
click to vote
HIPC
1999
Springer
15 years 7 months ago
1999
Springer
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
156
click to vote
SIAMSC
2010
14 years 10 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
126
click to vote
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
120
click to vote
CHARME
2001
Springer
15 years 6 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
211
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...