11129 search results - page 37 / 2226 » Modeling Search Computing Applications |
TPCG
2003
IEEE
15 years 3 months ago
2003
IEEE
ISMB
1997
14 years 11 months ago
1997
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
112
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Face verification has many potential applications including
filtering and ranking image/video search results on
celebrities. Since these images/videos are taken under uncontrolle...