---
monty 1987 wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-fd5190c7df-578807e516-572fe5d0cb8f9527
You'll need to
Hello,
In a program I am currently writing, I have a matrix (around 6 x
3) containing information about the pixels in an image: every row of
the matrix has information about 1 pixel. The first column contains
the pixel id and the following two columns contain the x and y
coordinates. If two
http://en.wikipedia.org/wiki/Longest_increasing_subsequence_problem
This link depicts an algorithm, which is O(nlogn) algo.
Approach: dynamic programming.
On 4/15/07, Daniel Bastidas [EMAIL PROTECTED] wrote:
if you can find the programming challenge book, there is a Longest
Increasing
Thanks for your announcement.
On 4/14/07, A. M. G. Solo [EMAIL PROTECTED] wrote:
Call For Papers - Deadline: May 1, 2007
WORLDCOMP'07
The 2007 World Congress in Computer Science,
Computer Engineering, and Applied Computing
