It’s possible.
Scan the digital picture pixel by pixel and line by line until you find the
first line with two black pixels ( the adjacent pixels is counted as only one
),name the two pixels a1(xa1,ya1) and b1(xb1,yb2), continue scaning and you
will get a2(xa2,ya2) and b2(xb2,yb2), a3(xa3,ya
hmmm, how can u find w/o knowing theta?
otherwise, 2*pi*r*(theta/360)
On Jan 3, 2008 6:18 PM, Daniel Bastidas <[EMAIL PROTECTED]> wrote:
> Hi everybody.
>
> How can I find the arc length (L) in the picture attach if the only thing
> I know is the radio of circumference.
> I don´t know the coorden
Hi everybody.
How can I find the arc length (L) in the picture attach if the only thing I
know is the radio of circumference.
I don´t know the coordenates of the intersection between line and
circumference neither the theta angle.
Any idea, it is possible...?.
Thanks
--~--~-~--~~-
At risk of stating the incredibly obvious, or giving away answer to a
fun interview question.
The naive but correct algorithm that gives the solution will have
tried every combination M of K swimmers in M events. which will give
you K!/(K-M)! arrangements, and the algorithm would then compare the
Do a Named entity Recognition on both the documents and then try and
see how similar are these?
Can you tell me how well/ill structured are your documents?
You could use a distance metric using these named entities.
Abhishek S
On Jan 3, 1:35 am, Arun <[EMAIL PROTECTED]> wrote:
> for first part,
