- From: Peter Thatcher <pthatcher@google.com>
- Date: Mon, 4 Aug 2014 10:50:15 -0700
- To: Dan Burnett <dburnett@voxeo.com>
- Cc: "public-media-capture@w3.org" <public-media-capture@w3.org>
Received on Monday, 4 August 2014 17:51:28 UTC
I've updated and have attached the slides to include the relationship of "min distance" to "advanced". It put it after the application of min/max/exact and before the application of "min distance". We might need to discuss if that's the best place to put it. On Mon, Aug 4, 2014 at 8:07 AM, Dan Burnett <dburnett@voxeo.com> wrote: > Having participated heavily in the brainstorming on this, I was unable to participate in the final discussion before the slides went out and thus could not confirm in time for my name to be listed in the "we approve list" in the slide deck. For the record, I am also in favor of the min distance algorithm approach presented and recommend it as well. > > -- dan > > On Aug 2, 2014, at 12:24 PM, Peter Thatcher wrote: > >> I have prepared and attached slides for the call next Tuesday. It >> presents two possible algorithms for "ideal", and recommends the >> first, called "min distance". It is the combination of input from >> many people in the WG, and I hope we have finally found a solution >> that everyone can agree to. >> >> I apologize for how close this is to the call next Tuesday, and I hope >> you will have time to review it. >> >> Thanks, >> Peter >> <Finding an -Ideal- Algorithm (2).pdf> >
Received on Monday, 4 August 2014 17:51:28 UTC