535 search results - page 103 / 107 » Predicting Application Run Times Using Historical Informatio... |
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
Bridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control sy...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
BMCBI
2005
13 years 7 months ago
2005
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
SIGECOM
2010
ACM
14 years 12 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...