184 search results - page 29 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
BIB
2008
13 years 8 months ago
2008
The accuracy and scalability of multiple sequence alignment (MSA) of DNAs and proteins have long been and are still important issues in bioinformatics. To rapidly construct a reas...
CGI
1998
IEEE
14 years 27 days ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
SICHERHEIT
2010
13 years 6 months ago
2010
Intrusion-tolerant replication enables the construction of systems that tolerate a finite number of malicious faults. An arbitrary number of faults can be tolerated during system ...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
AAAI
2004
13 years 10 months ago
2004
This paper presents a new boosting (arcing) algorithm called POCA, Parallel Online Continuous Arcing. Unlike traditional boosting algorithms (such as Arc-x4 and Adaboost), that co...