2260 search results - page 352 / 452 » A new algorithm for clustering search results |
185
click to vote
RECOMB
2002
Springer
16 years 6 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
163
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Fault-based testing is often advocated to overcome limitations of other testing approaches; however it is also recognized as being expensive. On the other hand, evolutionary algor...
200
click to vote
TALG
2008
15 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
167
click to vote
WWW
2002
ACM
16 years 7 months ago
2002
ACM
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
224
click to vote
PVM
1997
Springer
15 years 10 months ago
1997
Springer
The extremely low latencies and high bandwidth results achievable with the Scalable Coherent Interface SCI at lowest level encourages its integration into existing Message Passin...