Sciweavers

6110 search results - page 68 / 1222
» Approximate Computing
Sort
View
DAGSTUHL
2008
15 years 4 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
132
Voted
JSC
2008
162views more  JSC 2008»
15 years 2 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
115
Voted
RECOMB
2002
Springer
16 years 2 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
15 years 9 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
147
Voted
TCOS
2010
15 years 29 days ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...