Page title matches

Page text matches

  • * <math>\lambda_1 = \lambda_2 = 0</math>: uniform gray value, and <math>C</math> is a null matrix
    14 KB (2,253 words) - 12:21, 9 January 2009
  • **[[2011 Spring AGEC 430 Allan Gray|AGEC 430 Prof. Gray]]
    13 KB (1,570 words) - 13:53, 7 August 2018
  • <br/><math>x(n) \in {0,1,2,...,255}</math> <-- gray scale valued signal <u>example</u>: 128x128 gray scale image<br/>
    3 KB (532 words) - 06:43, 16 September 2013
  • ...d a recurrence for making a row of colored tiles, colors being red, green, gray. What if red tiles cannot be adjacent? What are the initial conditions? (N
    3 KB (529 words) - 17:33, 22 October 2010
  • {|style="width:75%; background: none; text-align: center; border:1px solid gray;" align="center" | colspan="4" style="border:2px solid gray;"| <math>\,\!\mbox{Initial- and Final-Value Theorem}</math>
    21 KB (3,312 words) - 11:58, 5 December 2008
  • {|style="width:75%; background: none; text-align: center; border:1px solid gray;" align="center"
    3 KB (499 words) - 03:24, 6 December 2008
  • {|style="width:85%; background: none; text-align: center; border:1px solid gray;" align="center" | colspan="4" style="border:2px solid gray;"| Initial-Value Theorem
    6 KB (938 words) - 06:59, 8 December 2008
  • {|style="width:75%; background: none; text-align: center; border:1px solid gray;" align="center"
    3 KB (356 words) - 06:51, 8 December 2008
  • {|style="width:85%; background: none; text-align: center; border:1px solid gray;" align="center" | colspan="4" style="border:2px solid gray;"| Initial-Value Theorem
    3 KB (421 words) - 06:52, 8 December 2008
  • {|style="width:75%; background: none; text-align: center; border:1px solid gray;" align="center" | colspan="4" style="border:2px solid gray;"| <math>\,\!\mbox{Initial- and Final-Value Theorem}</math>
    2 KB (358 words) - 06:53, 8 December 2008
  • ...lane (black line) in this case goes through the middle line of the vector (gray line).
    9 KB (1,586 words) - 08:47, 17 January 2013
  • Summary: The sanner calibrtion has largely two procedures, gray balancing and transfrom linear RGB data to device independent XYX data. The
    2 KB (308 words) - 18:24, 22 October 2010
  • ...parametric clustering approaches, such as classical kmeans, the Linde-Buzo-Gray (LBG) algorithm and information-theoretic clustering, which arise by specia
    39 KB (5,715 words) - 10:52, 25 April 2008
  • The algorithm is named after Linde,Buzo and Gray.
    903 B (157 words) - 01:07, 7 April 2008
  • ...lihood estimates can be used in image matching (edge template matching and gray-level image matching). This can be applied to stereo matching and feature t
    6 KB (905 words) - 12:18, 28 April 2008
  • ...lihood estimates can be used in image matching (edge template matching and gray-level image matching). This can be applied to stereo matching and feature t
    4 KB (549 words) - 14:40, 25 April 2008
  • color[v]=GRAY Whenever a node is discovered it is paintd gray and put into a queue. When all its neighbours are explored then it is color
    3 KB (557 words) - 17:49, 22 October 2010
  • ...olid black square outlaid on a white background will now look blurry with "gray" pixels at the periphery of the square. This type of compression artifact c
    6 KB (914 words) - 12:07, 22 October 2009
  • gray I wrote a function grs2rgb(image,MAP);which can change any gray image to any desirable shade.Some example are as following:[[Image:hot.jpg]
    3 KB (463 words) - 21:40, 22 September 2009
  • title('Original Image in Gray scale');
    782 B (107 words) - 06:01, 14 October 2009

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett