On Jun 24, 11:16 am, "M. Funkibut" <[EMAIL PROTECTED]> wrote:
> I assume there is a 'scanner' [some sort of filtered photoelectric
> eye] that outputs an RGB triple to a software routine that then
> produces a paint 'formula' that hardwarestoreguy can mix up.
>
> But how do you get from RGB to the
On Jun 24, 2:16 pm, "M. Funkibut" <[EMAIL PROTECTED]> wrote:
>
> But how do you get from RGB to the paint formula? Can you go from a
> paint formula to RGB? Does anybody know where I can find a reference
> book/article on this? I've looked and come up empty.
Don't really know how they did it.
RGB to Pantone?
-> http://www.netfront.fr/Services/rgb2pantone/
On 6/24/08, M. Funkibut <[EMAIL PROTECTED]> wrote:
>
>
> In the USA currently there is a television commercial in which people
> bring in weird stuff [like a giant purple walrus toy] and have paint
> made to that 'exact' color.
>
>
In the USA currently there is a television commercial in which people
bring in weird stuff [like a giant purple walrus toy] and have paint
made to that 'exact' color.
Many of us have gone to Home Depot/Lowes/whatever with a piece of trim
and had paint made that 'matches'.
How does this work?
I
>
> I am not much clear about the 3rd Requirement, "3. Min. the number of bus
> changes"
> Please explain.
Perhaps it is just a count of nodes tranversed? Perhaps nodecount-2
[don't count start or finish?]
-MF
--~--~-~--~~~---~--~~
You received this message becau
referring to the chapter 15 ( dynamic programming ) of CLR ..
how to prove that the number of sub problems of the matrix
multiplication problem is O(n^2)
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorit
u can use in trees and weighted merge and path compression to get a
amoortised log*n algo for union which is mostly used in MST probs
2008/6/23 Geoffrey Summerhayes <[EMAIL PROTECTED]>:
>
> On Jun 23, 12:36 pm, zee <[EMAIL PROTECTED]> wrote:
> > do we have an algo for finding the union of two se
