From serban@bnl.gov Thu Apr 29 17:10:19 2004
Date: Fri, 16 Apr 2004 11:17:13 -0400
From: Serban Protopopescu <serban@bnl.gov>
To: Gustaaf Brooijmans <gusbroo@fnal.gov>
Cc: d0dfwg@fnal.gov
Subject: Re: Questions at the ADM

    [ The following text is in the "ISO-8859-1" character set. ]
    [ Your display is set for the "US-ASCII" character set.  ]
    [ Some characters may be displayed incorrectly. ]

But that could still be applied centrally at the time the root trees are
being made rather then in d0reco. It does imply the root tree is made
in separate steps (by that I mean inside the same program)
but there are no structural impediments to doing that. It does
also imply that algorithms applied centrally cannot be a free for all.

      Serban

Gustaaf Brooijmans wrote:

>>I see no compelling reason for an algorithm applied after d0correct
>>that is fast compared  to unpacking to migrate (except if the sum of all
>>is substantial compared to unpacking).
>>
>>
>
>I do - the fact that it gets applied centrally and nobody makes a mistake
>when running it!  We wouldn't have d0correct if all correction could be
>made at reco time...
>
>Gustaaf
>
>