|
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
|
|
|
|
|
Please help!
Need any fingerprint recognition algorithm realisation.
Thanks for any information.
|
|
|
|
|
Try Home land security... or HP...
Brad
Australian
I assume Microsoft would not use doors, because using Windows is faster.
|
|
|
|
|
You may find many of these are under patent
Blog Have I http:\\www.frankkerrigan.com
|
|
|
|
|
Frank Kerrigan wrote: You may find many of these are under patent
Yep. Come up with your own algorithm and patent it
If you try to write that in English, I might be able to understand more than a fraction of it. - Guffa
|
|
|
|
|
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!!!
|
|
|
|
|
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??
;)
thank you very much..
|
|
|
|
|
|
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
|
|
|
|
|
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.
|
|
|
|
|
|
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.
|
|
|
|
|
If you try to write that in English, I might be able to understand more than a fraction of it. - Guffa
|
|
|
|
|
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
|
|
|
|
|
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
|
|
|
|
|
They must use a different set of public/private keys.
In oder case it can break RSA. See Euclidian algorithms.
|
|
|
|
|
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. - Shog9
Ed
|
|
|
|
|
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].
|
|
|
|
|
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)
|
|
|
|
|
"Ini idi vichi!".
"came saw win!"
you must know this words.(they are to old and to big for one mane)
|
|
|
|
|
It's actually "Veni, vidi, vici"
- Xint0
|
|
|
|
|
eheheh right Xint0
|
|
|
|
|
Xint0 wrote: "Veni, vidi, vici"
|
|
|
|
|
Hi there
I am encrypting passwords to a database and wish to use the .NET framework to encrypt them.
I know that MD5 and SHA-1 have been compromised. However for the purpose of passwords in a database how weak are they? If they are too weak what is another decent algorithm?
Thanks
Dan
|
|
|
|
|