1129 search results - page 78 / 226 » Finding Similar Failures Using Callstack Similarity |
CIBCB
2007
IEEE
14 years 2 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
EMNLP
2010
13 years 6 months ago
2010
We describe a new approach to SMT adaptation that weights out-of-domain phrase pairs according to their relevance to the target domain, determined by both how similar to it they a...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
Axelrod’s original experiments for evolving IPD player strategies involved the use of a basic GA. In this paper we examine how well a simple GA performs against the more recent P...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8, 4, ...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...