2957 search results - page 577 / 592 » The Complexity of Polynomial-Time Approximation |
CGF
2010
13 years 7 months ago
2010
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
ENTCS
2008
13 years 7 months ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...