2957 search results - page 311 / 592 » The Complexity of Polynomial-Time Approximation |
204
click to vote
TCS
2010
15 years 1 months ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
190
click to vote
ISBI
2011
IEEE
14 years 10 months ago
2011
IEEE
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
314
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
143
click to vote
ISSAC
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
165
Voted
DCC
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...