6110 search results - page 32 / 1222 » Approximate Computing |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
AMC
2007
13 years 9 months ago
2007
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...
DLT
2009
13 years 7 months ago
2009
Abstract. We consider algorithms for approximating context
CMSB
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Starting from a biochemical signalling pathway model expressed in a process algebra enriched with quantitative information we automatically derive both continuous-space a...
CG
2005
Springer
13 years 9 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...