• [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    2 KB (266 words) - 12:35, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    921 B (156 words) - 12:50, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (177 words) - 12:35, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (168 words) - 12:51, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    846 B (122 words) - 12:51, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    845 B (149 words) - 12:36, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    981 B (144 words) - 12:47, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    842 B (140 words) - 12:30, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    906 B (151 words) - 12:51, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (192 words) - 12:35, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    929 B (140 words) - 12:48, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (179 words) - 12:32, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    2 KB (353 words) - 12:23, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (181 words) - 12:36, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (218 words) - 12:25, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (218 words) - 12:22, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    919 B (145 words) - 12:52, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    2 KB (280 words) - 12:37, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    757 B (115 words) - 12:48, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (184 words) - 12:47, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (177 words) - 12:24, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (239 words) - 12:39, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    917 B (138 words) - 12:52, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    965 B (145 words) - 12:37, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (160 words) - 12:40, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (201 words) - 12:44, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (220 words) - 12:40, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (203 words) - 12:53, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (206 words) - 12:36, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    1 KB (161 words) - 12:52, 16 September 2013
  • [[Category:problem solving]] A [[CT_Fourier_transform_practice_problems_list|practice problem on CT Fourier transform]]
    803 B (124 words) - 12:49, 16 September 2013
  • [[Category:problem solving]] =Some Practice Exam Problems for signals and systems ([[ECE301]])=
    4 KB (753 words) - 16:48, 23 April 2013
  • but that would have meant students had less practice for passing the budget problem.
    4 KB (744 words) - 08:14, 26 November 2008
  • Refers to the problem caused by exponential growth of hypervolume as a function of dimensionality == [[Dual Problem_Old Kiwi|Dual Problem]] ==
    31 KB (4,832 words) - 18:13, 22 October 2010
  • ...are defined by hypersurfaces. - Consider a Nearest Neighbor classification problem: The classification of any query is decided by the label of its nearest nei ...t d>17-23. There are no clusters or groupings of data points when d>17. In practice each point turns to be a cluster on its own and as a result this explodes i
    5 KB (843 words) - 08:46, 17 January 2013
  • But, in practice, we do not have linear separable data. So instead, we use the Least Squares ...o solve. Therefore, we need to convert this problem into a linear equality problem.
    5 KB (755 words) - 08:48, 17 January 2013
  • The MLE does have some disadvantages in practice: ...between these two methods, they are quite similar when they are applied in practice.
    6 KB (995 words) - 10:39, 20 May 2013
  • practice. More recently, neural network techniques and methods imported from statist general problem of recognizing complex patterns with arbitrary orientation, location, and s
    39 KB (5,715 words) - 10:52, 25 April 2008
  • ...ains.) Thus, it is often advantageous to conceive of the anomaly detection problem as the task of developing a strong model of normal behaviors and detecting ..., the anomaly detection problem can be framed as a distribution estimation problem for a single class of data (normal behavior) coupled with a threshold selec
    6 KB (905 words) - 12:18, 28 April 2008
  • But, in practice, we do not have linear separable data. So instead, we use the Least Squares ...o solve. Therefore, we need to convert this problem into a linear equality problem.
    3 KB (528 words) - 13:52, 2 February 2012
  • Refers to the problem caused by exponential growth of hypervolume as a function of dimensionality ...t d>17-23. There are no clusters or groupings of data points when d>17. In practice each point turns to be a cluster on its own and as a result this explodes i
    831 B (120 words) - 10:57, 10 June 2013
  • ...true distribution of the data is known. Although it can rarely be used in practice, it represents an ideal classification rate which other algorithms may atte Bayes rule addresses the predefined classes classification problem.
    2 KB (399 words) - 14:03, 18 June 2008
  • * Problem: All methods presented above encounter a serious problem because of the following reasons: In practice, use 'Gradient descent'
    8 KB (1,337 words) - 08:44, 17 January 2013
  • ==Problem sets for '08== * [[Problem Set 1_Old Kiwi]]
    894 B (136 words) - 13:41, 22 July 2008
  • * Individual students can write pages of practice exercises for certain computations/concepts along with their answers. (See * Students can write pages that compare different solutions to a problem.
    5 KB (832 words) - 10:36, 25 August 2008
  • [[Category:practice problem]]
    6 KB (975 words) - 15:35, 25 February 2015
  • [[Category:problem solving]] A [[Signals_and_systems_practice_problems_list|practice problem on "Signals and Systems"]]
    2 KB (276 words) - 10:09, 16 September 2013
  • [[Category:practice problem]] ==Problem==
    2 KB (408 words) - 17:20, 25 February 2015
  • [[Category:practice problem]] ==Problem==
    1 KB (241 words) - 17:06, 25 February 2015
  • [[Category:practice problem]] ==Problem==
    2 KB (415 words) - 17:05, 25 February 2015
  • [[Category:practice problem]] ==Problem==
    3 KB (432 words) - 17:55, 25 February 2015
  • Each problem of each exam will be assigned to one or more of the five outcome categories The ECE faculty expect every member of the Purdue community to practice honorable and ethical behavior both inside and outside the classroom. Any
    7 KB (1,153 words) - 14:06, 24 August 2009
  • [[Media:Aug_26_2009.pdf | '''First problem set''' on ordered sets, fields, and mainly supremums]] On Number 4 of this problem set assume "n" and "m" are positive integers. ( I originally typed "non-neg
    2 KB (375 words) - 06:18, 10 December 2009
  • ...c. I found lecture to be very minimalist (at least as far as going through practice problems), so I utilized my T.A. very heavily (just about every week). Be s ...sed on her lectures. So try to follow her in the lecture and make sure you practice the related problems as semester proceeds, otherwise you'll have to feed yo
    10 KB (1,812 words) - 14:00, 16 December 2011
  • [http://www.math.purdue.edu/~bell/MA425/prac1.pdf Practice Problems for Exam 1] '''Problem 1''': I am still a bit confused as to the geometric interpretation. If <m
    3 KB (578 words) - 09:12, 7 October 2009
  • ...ing Euler's formula to compute the norm of a complex exponential (practice problem)]] from [[ECE438]] ...plex_numbers_ECE301S11|Compute the the norm of a complex numbers (practice problem)]] from [[ECE301]]
    2 KB (293 words) - 05:21, 3 November 2011
  • ...ing Euler's formula to compute the norm of a complex exponential (practice problem)]] from [[ECE438]] ...1|Using Euler's formula to compute the norm of a complex numbers (practice problem)]] from [[ECE301]]
    2 KB (249 words) - 18:27, 23 February 2015
  • [http://www.math.purdue.edu/~bell/MA425/prac2.pdf Practice Problems for Exam 2] On Problem 1 from the practice problems I was thinking Liouville's theorem, but that is for a bounded enti
    2 KB (362 words) - 19:41, 17 November 2009
  • ...hich helps in any class) and doing plenty of practice problems. You should practice doing geometric sums and knowing how to manipulate sums using a change of v ...rses tend to be harder to understand. The material is incredibly useful in practice (although it may not be immediately obvious), and I can say personally that
    14 KB (2,366 words) - 17:32, 21 April 2013
  • ...all of the "formulas" 100%, you can still do pretty well by doing a ton of practice problems. And there are plenty of old exams to look at on old ECE 438 websi ...leted ECE 301 in development of a Digital Signal Processing vocabulary and practice with necessary mathematical examples. As has been stated by other postings
    17 KB (3,004 words) - 08:11, 15 December 2011
  • ...se that gives [[ECE]] majors the foundation of everything that is [[ECE]]. Problem is, [[ECE202]] cancels out the methods learned in [[ECE201]]. Maybe [[ECE20 ...ams are multiple choice, you should very rarely have to completely solve a problem. Use a process of elimination to narrow the possibilities to three, then fi
    6 KB (1,125 words) - 10:39, 12 December 2013
  • ...of available "slots" by three. The advantage of this technique is that the problem now follows ordinary permutation rules. Your algorithm might be: pick the l ...inguish between, say, "ABCDEF" and "FEDCBA". So this is a permutation type problem.
    11 KB (2,121 words) - 10:51, 15 February 2010
  • .... but it will converge. Note that this algo. is only occasionally used in practice. (If you are interested in this from an algorithmic standpoint, examine th Now we will formulate our problem as a ''Least Squares Procedure.''<br>
    9 KB (1,536 words) - 07:26, 12 April 2010
  • ...s semester, &nbsp;i thought that writing this contribution might be a good practice on how perceptron classifier in batch mode works. ...&gt; + b = 0} that separate the training vectors of the two classes , this problem can be defined as solving the set of linear inequalities below with respect
    3 KB (429 words) - 07:29, 12 April 2010
  • ==Practice Exam 4== ==Practice Exam 6==
    965 B (165 words) - 05:16, 28 July 2010
  • [[Category:problem solving]] = This pages contains exercises to practice computing the Fourier series of a CT signal =
    5 KB (797 words) - 09:43, 29 December 2010
  • [[Category:problem solving]] =This pages contains exercises to practice computing the Fourier series of a DT signal =
    2 KB (355 words) - 09:44, 29 December 2010
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    4 KB (662 words) - 12:44, 26 November 2013
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    5 KB (766 words) - 14:22, 21 April 2013
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    3 KB (569 words) - 12:48, 26 November 2013
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    2 KB (273 words) - 12:49, 26 November 2013
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    7 KB (1,273 words) - 12:42, 26 November 2013
  • Refers to the problem caused by exponential growth of hypervolume as a function of dimensionality == [[Dual Problem_Old Kiwi|Dual Problem]] ==
    31 KB (4,787 words) - 18:21, 22 October 2010
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    2 KB (322 words) - 13:00, 26 November 2013
  • [http://www.math.purdue.edu/~bell/MA527/prac2solns.pdf Exam 2 Practice Problem Solutions]
    1 KB (207 words) - 12:06, 16 November 2010
  • [[Category:problem solving]] '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''
    2 KB (327 words) - 19:05, 3 March 2015
  • This is&nbsp;where most students have problem, especially during&nbsp;exams. Although the polynomial is to the power of t ...s is one chapter where everything just comes in together. (iii) Do lots of practice, especially the ones involving complex numbers and the questions where you
    18 KB (2,963 words) - 07:22, 3 July 2012
  • == Work area for Practice Final Exam questions == For problem 1 on the practice problems, is the reason the answer is D is because det(A) has infinitely ma
    7 KB (1,359 words) - 02:59, 14 December 2010
  • *As requested by some students, I added three problems to practice CT convlution, and two problems for practicing basic signal's properties. - <br> Can a problem similar to Exam 2, Question 2 be posted using a CT signal rather than a DT
    18 KB (2,485 words) - 10:36, 11 November 2011
  • '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]''' [[Signals_and_systems_practice_problems_list|More Practice Problems]]
    3 KB (397 words) - 16:17, 26 November 2013
  • '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]''' [[Signals_and_systems_practice_problems_list|More Practice Problems]]
    2 KB (292 words) - 16:17, 26 November 2013
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]'''
    2 KB (326 words) - 16:18, 26 November 2013
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]'''
    4 KB (595 words) - 11:01, 21 April 2015
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Problem on "Signals and Systems"]]'''
    4 KB (675 words) - 16:15, 26 November 2013
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]'''
    3 KB (529 words) - 05:59, 21 September 2013
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]'''
    2 KB (259 words) - 16:22, 26 November 2013
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]'''
    1 KB (241 words) - 16:23, 26 November 2013
  • = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution = ...TA's comment: Very good. I suggest that you flip the input signal for this problem and not the impulse response. The convolution will then be much easier. In
    2 KB (380 words) - 10:20, 11 November 2011
  • [[Category:problem solving]] = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution=
    2 KB (389 words) - 10:23, 11 November 2011
  • *Solve the following practice problem:
    2 KB (253 words) - 14:10, 28 February 2011
  • *[[Output_of_LTI_DT_system_by_convolution_ECE301S11|Practice problem on DT convolution, from ECE301 Spring 2011]]
    735 B (103 words) - 11:40, 30 January 2011
  • [[Category:problem solving]] = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution=
    1,005 B (155 words) - 10:21, 11 November 2011
  • [[Category:problem solving]] = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution=
    1 KB (178 words) - 10:21, 11 November 2011
  • [[Category:problem solving]] = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution=
    1 KB (178 words) - 10:21, 11 November 2011
  • [[Category:problem solving]] = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution=
    897 B (137 words) - 10:21, 11 November 2011
  • [[Category:problem solving]] = [[:Category:Problem_solving|Practice Question]] on Computing the Output of an LTI system by Convolution=
    1 KB (187 words) - 10:22, 11 November 2011
  • *By popular demand, I added more practice problems related to the convolution sum. *You should also try the practice problem for the CT convolution:
    2 KB (322 words) - 14:10, 28 February 2011
  • ...m_cosine_DT_ECE301S11|Problem 2]], [[Fourier_transform_window_DT_ECE301S11|Problem 3]] Problem: given <math class="inline"> x_d[n] </math> can you reconstruct <math class
    10 KB (1,788 words) - 09:22, 11 April 2013
  • ...tin_Making_Answer_Fit_Solution_Key|Making your answer fit the solution for problem 22.a b)]] *[[Examples ECE301Fall2008mboutin|Some practice exam problems]]
    6 KB (818 words) - 06:12, 16 September 2013
  • [[Category:problem solving]] '''[[Signals_and_systems_practice_problems_list|Practice Question on "Signals and Systems"]]'''
    2 KB (278 words) - 16:21, 26 November 2013

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

Alumni Liaison

Ph.D. on Applied Mathematics in Aug 2007. Involved on applications of image super-resolution to electron microscopy

Francisco Blanco-Silva