Sciweavers

534 search results - page 29 / 107
» Efficient polynomial L-approximations
Sort
View
TOMS
2008
87views more  TOMS 2008»
13 years 7 months ago
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
Hassan Goldani-Moghaddam, Wayne H. Enright
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 7 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
RP
2010
Springer
118views Control Systems» more  RP 2010»
13 years 5 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
DBPL
2007
Springer
101views Database» more  DBPL 2007»
13 years 11 months ago
Efficient Inclusion for a Class of XML Types with Interleaving and Counting
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
EUROCRYPT
2006
Springer
13 years 11 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld