Why are kernel methods with RBFs effective for handwritten digits (letters) classification?

A license plate consists of two letters followed by three digits. How many possible combinations are there?

  • Answer:

    1. 26*26*9*9*9 = 492,804 <------- 2. presumably zero is now allowed, so 26*25*10*9*8 = 468,000 <----- if zero isn't allowed, 26*25*9*8*7 = 327,600 <-------

PRINCESS at Yahoo! Answers Visit the source

Was this solution helpful to you?

Other answers

1. 26*26*9*9*9 = 492,804 <------- 2. presumably zero is now allowed, so 26*25*10*9*8 = 468,000 <----- if zero isn't allowed, 26*25*9*8*7 = 327,600 <-------

M3

Related Q & A:

Just Added Q & A:

Find solution

For every problem there is a solution! Proved by Solucija.

  • Got an issue and looking for advice?

  • Ask Solucija to search every corner of the Web for help.

  • Get workable solutions and helpful tips in a moment.

Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.