Re: fingerprint recognition algorithm - Algorithms Discussion Boards

First Prev Next

Re: first occurence of multiple search terms in a string

A.A.7-Dec-06 3:28

A.A.

7-Dec-06 3:28

Look at the two classics: Knuth-Pratt-Morris and Boyer-Moore algorithms.[^] They have a good worst case running time.

You can find a decent discussion on both in any standard algorithms book.

Finding Allah
Surah AlHaaqa(The Reality)
Surah Qaf
Eid Alfitr

Re: first occurence of multiple search terms in a string

peterchen9-Dec-06 3:05

peterchen

9-Dec-06 3:05

Boyer-Moore looks very clever! The site has some other interesting algorithms as well

Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers!
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
Linkify!|Fold With Us!

Re: first occurence of multiple search terms in a string

Harald Krause11-Dec-06 4:33

Harald Krause

11-Dec-06 4:33

You can also use the Alfred V. Aho & Margaret J. Corasick search algorithm wich as a O(1)
I can send you a .cpp implentation if you like

fingerprint recognition algorithm

Alex19823-Dec-06 20:41

Alex1982

3-Dec-06 20:41

Please help!
Need any fingerprint recognition algorithm realisation.

Thanks for any information.

Re: fingerprint recognition algorithm

Bradml4-Dec-06 0:47

Bradml

4-Dec-06 0:47

Try Home land security... or HP...

Brad
Australian
I assume Microsoft would not use doors, because using Windows is faster.

Re: fingerprint recognition algorithm

Frank Kerrigan4-Dec-06 3:07

Frank Kerrigan

4-Dec-06 3:07

You may find many of these are under patent

Blog Have I http:\\www.frankkerrigan.com

Re: fingerprint recognition algorithm

Paul Conrad5-Dec-06 11:30

Paul Conrad

5-Dec-06 11:30

Frank Kerrigan wrote:
You may find many of these are under patent

Yep. Come up with your own algorithm and patent it Big Grin | :-D

If you try to write that in English, I might be able to understand more than a fraction of it. - Guffa

Re: fingerprint recognition algorithm

Tal Even-Tov8-Dec-06 9:40

Tal Even-Tov

8-Dec-06 9:40

These algorithms are very difficult to come by mainly because they are still being researched. Many such algorithms have been developed but their development is usually a result of a research project which has been funded by some organisation. These organisations don't release the algorithms because they see the algorithm as an investment and would help them against their competition.

Sorry, but I don't think you will find one easily. If you do find any open source algorithms then they are probably quite complex and use machine learning techniques such as Neural Networks or Hidden Markov Models.

These algorithms fall under Image Processing/Signal Processing try doing searches within these areas.

The best times in life are the ones that you can't remeber!!!

problem in algorithm!!

CHELA FE3-Dec-06 16:16

CHELA FE

3-Dec-06 16:16

when we are making a code our teacher make as first the algorithm bec. she say that it becomes easy when we have the algorithm. can you give me some examples of algorithm??
Smile | :)

;)

thank you very much..

Re: problem in algorithm!!

Are Jay3-Dec-06 17:52

Are Jay

3-Dec-06 17:52

Great examples wikipedia[^].

Re: problem in algorithm!!

David Crow5-Dec-06 4:56

David Crow

5-Dec-06 4:56

It's always easier to formulate your design on paper first before going to the keyboard. Remember that a computer cannot do anything that you can't already do with pencil and paper.

"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15

"Judge not by the eye but by the heart." - Native American Proverb

Polygon Union/intersect

rpz27-Nov-06 8:29

rpz

27-Nov-06 8:29

Does anyone have some quick example code for computing the union of two n-point polygons (or alternatively, an n-point polygon and a rectangle). I want what the Region class in the .NET framework does, but i need the actual points afterwards, which Region doesn't provide.

Math whiz's ending could score $100K

Bassam Abdul-Baki26-Nov-06 16:46

Bassam Abdul-Baki

26-Nov-06 16:46

Prolific 18th-century mathematician Leonhard Euler may not be a household name, but Tullahoma calculus whiz Larissa Wenren, 16, knows him well enough to finish his sentences. And she could win a $100,000 scholarship for it.[^]

The abstract link is on the right under related media.

"Marge, don't discourage the boy! Weasling out of things is important to learn. It's what separates us from the animals! Except the weasel." - Homer Simpson

Web - Blog - RSS - Math - LinkedIn - BM

Re: Math whiz's ending could score $100K

Shog⁹26-Nov-06 16:49

Shog⁹

26-Nov-06 16:49

Bassam Abdul-Baki wrote:
Prolific 18th-century mathematician Leonhard Euler may not be a household name, but Tullahoma calculus whiz Larissa Wenren, 16, knows him well enough to finish his sentences.

Bah, that's no trick. Couple hundred years in the ground, and i'll bet most people sound about the same.

----
I just want you to be happy;
That's my only little wish...

Re: Math whiz's ending could score $100K

Paul Conrad26-Nov-06 17:22

Paul Conrad

26-Nov-06 17:22

If you try to write that in English, I might be able to understand more than a fraction of it. - Guffa

How to Read 12 Digit UPC Barcodes

Bassam Abdul-Baki22-Nov-06 4:13

Bassam Abdul-Baki

22-Nov-06 4:13

Interesting.[^]

"This perpetual motion machine she made is a joke. It just keeps going faster and faster. Lisa, get in here! In this house, we obey the laws of thermodynamics!" - Homer Simpson

Web - Blog - RSS - Math - LinkedIn - BM

Public keys

DanB198318-Nov-06 0:32

DanB1983

18-Nov-06 0:32

Hi
When using RSA encryption for a website registration page (from browser to server) is it ok to use the same public/private key for all users or should each request for registration use a different set of public/private keys?

Thanks

Dan

Re: Public keys

Bagaturia david19-Nov-06 21:57

Bagaturia david

19-Nov-06 21:57

They must use a different set of public/private keys.
In oder case it can break RSA. See Euclidian algorithms.

Re: Public keys

Ed.Poore22-Nov-06 3:57

Ed.Poore

22-Nov-06 3:57

As long as the private key is kept secure you can keep the same one. I don't think there's any advantage in using different sets of keys because of the nature of public key cryptography it doesn't matter if the public key is well, public.

If you're sending a private key to the client for communication purposes then use different ones. Or even better, if you can, get the client to generate one locally so that it's never sent between client and server.

Formula 1 - Short for "F1 Racing" - named after the standard "help" key in Windows, it's a sport where participants desperately search through software help files trying to find actual documentation. It's tedious and somewhat cruel, most matches ending in a draw as no participant is able to find anything helpful. - Shog⁹

Ed

3D Bitmaps

Bagaturia david15-Nov-06 20:27

Bagaturia david

15-Nov-06 20:27

Hi all.

I am David and I have bitmap photo of the wall, and I wont to set it like wall in 3D how can I do it, in other words I have flat and wont to rotate it in 3D.
[flat is (x';y') and 3D is (x;y;z), I wont to rotate (x';y') in (x;y;z)]
I wont affect like I am wake and near is wall.
What I must do for it, if you know some algorithm tell me ware I can find it.
(I have not problem with math and time is not problem too)

thanks for any help [it all will useful]. Smile | :)

Re: 3D Bitmaps

El Corazon16-Nov-06 7:25

El Corazon

16-Nov-06 7:25

Bagaturia david wrote:
I am David and I have bitmap photo of the wall, and I wont to set it like wall in 3D how can I do it, in other words I have flat and wont to rotate it in 3D.

http://nehe.gamedev.net/lesson.asp?index=02[^]

_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)