62 search results - page 2 / 13 » Effective bounds for P-recursive sequences |
BMCBI
2007
13 years 11 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
GI
2009
Springer
13 years 8 months ago
2009
Springer
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
PG
2007
IEEE
14 years 5 months ago
2007
IEEE
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
ICPP
2003
IEEE
14 years 4 months ago
2003
IEEE
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...
NIPS
2007
14 years 8 days ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...