84 search results - page 3 / 17 » A Fibonacci-like Sequence of Composite Numbers |
WEBI
2010
Springer
13 years 6 months ago
2010
Springer
Majority of the existing approaches to service composition, including the widely popular planning based techniques, are not able to automatically compose practical workflows that ...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
KES
2005
Springer
14 years 2 months ago
2005
Springer
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
BMCBI
2010
13 years 8 months ago
2010
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...