16093 search results - page 2789 / 3219 » On the optimality of the neighbor-joining algorithm |
176
click to vote
PLDI
2005
ACM
16 years 17 days ago
2005
ACM
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
190
click to vote
SIGIR
2005
ACM
16 years 17 days ago
2005
ACM
This paper presents a new discriminative model for information retrieval (IR), referred to as linear discriminant model (LDM), which provides a flexible framework to incorporate a...
183
click to vote
APPROX
2005
Springer
16 years 17 days ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
204
Voted
GECCO
2005
Springer
16 years 16 days ago
2005
Springer
In medical research, being able to justify decisions is generally as important as taking the right ones. Interpretability is then one of the chief characteristics a learning algor...
199
click to vote
GECCO
2005
Springer
16 years 16 days ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...