Sciweavers

5128 search results - page 365 / 1026
» When Abstraction Fails
Sort
View
148
Voted
SIAMMA
2010
63views more  SIAMMA 2010»
15 years 2 months ago
Sparse Tensor Product Wavelet Approximation of Singular Functions
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...
Monique Dauge, Rob Stevenson
SIAMNUM
2010
91views more  SIAMNUM 2010»
15 years 2 months ago
Recovery-Based Error Estimators for Interface Problems: Mixed and Nonconforming Finite Elements
Abstract. In [9], we introduced and analyzed a recovery-based a posteriori error estimator for conforming linear finite element approximation to interface problems. It was shown th...
Zhiqiang Cai, Shun Zhang
TCS
2010
15 years 2 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
RSA
2011
131views more  RSA 2011»
15 years 2 months ago
On covering by translates of a set
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
Béla Bollobás, Svante Janson, Oliver...
ICASSP
2011
IEEE
14 years 11 months ago
A novel fast canonical-signed-digit conversion technique for multiplication
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
Rui Guo, Linda DeBrunner