155 search results - page 10 / 31 » Dynamic Succinct Ordered Trees |
FOCM
2010
14 years 8 months ago
2010
We show how B-series may be used to derive in a systematic way the analytical expressions of the high-order stroboscopic averaged equations that approximate the slow dynamics of h...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
KBSE
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a tool that (i) constructs tree-based models of a program’s behavior during testing and (ii) employs these trees while reordering and reducing a test suite. ...
101
click to vote
FOCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...