2127 search results - page 282 / 426 » Computing large matchings fast |
155
click to vote
PAMI
2011
14 years 7 months ago
2011
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
120
click to vote
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
111
click to vote
ICCAD
2005
IEEE
16 years 1 months ago
2005
IEEE
Abstract— A Kauffman network is an abstract model of gene regulatory networks. Each gene is represented by a vertex. An edge from one vertex to another implies that the former ge...
114
click to vote
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
Grid computing is becoming the natural way to aggregate and share large and heterogeneous sets of resources. However, grid development and acceptance hinge on proving that grids r...
127
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...