Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
435,261
The Omega Test: a fast and practical integer programming algorithm for dependence analysis
- Communications of the ACM
, 1992
"... The Omega testi s ani nteger programmi ng algori thm that can determi ne whether a dependence exi sts between two array references, and i so, under what condi7: ns. Conventi nalwi[A m holds thati nteger programmiB techni:36 are far too expensi e to be used for dependence analysi6 except as a method ..."
Abstract
-
Cited by 522 (15 self)
- Add to MetaCart
-case exponenti al ti me complexi ty. However, we show that for manysiB7 ti ns i whi h ...
De-Noising By Soft-Thresholding
, 1992
"... Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an a ..."
Abstract
-
Cited by 1279 (14 self)
- Add to MetaCart
Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0
Simple fast algorithms for the editing distance between trees and related problems
- SIAM J. COMPUT
, 1989
"... Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching i ..."
Abstract
-
Cited by 405 (12 self)
- Add to MetaCart
the descendants of node n. The analogous question for prunings as for subtrees is answered. A dynamic programming algorithm is presented to solve the three questions in sequential time O(I Tll x IT2lxmin (depth ( Tt), leaves ( T)) x min (depth(T2), leaves(T2))) and space O(Ir, x lT21) compared with o(I T,I IT=I x
ti
"... pu tio year n. O the ste ath to it. These marks are identified on every 2D image captured during the scanning procedure and used ..."
Abstract
- Add to MetaCart
pu tio year n. O the ste ath to it. These marks are identified on every 2D image captured during the scanning procedure and used
ti in
"... el fi n re a G l st uts tow s of n fr ily c in ial l tens; the dar 884 J. Opt. Soc. Am. A/Vol. 15, No. 4 /April 1998 Karman et al.the paraxial limit. In this limit one can analytically solve the Huygens–Fresnel diffraction integral in terms ..."
Abstract
- Add to MetaCart
el fi n re a G l st uts tow s of n fr ily c in ial l tens; the dar 884 J. Opt. Soc. Am. A/Vol. 15, No. 4 /April 1998 Karman et al.the paraxial limit. In this limit one can analytically solve the Huygens–Fresnel diffraction integral in terms
Results 1 - 10
of
435,261
