Sciweavers

998 search results - page 17 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
COMPUTING
2007
118views more  COMPUTING 2007»
13 years 7 months ago
The construction of good extensible Korobov rules
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
Josef Dick, Friedrich Pillichshammer, Benjamin J. ...
CCA
2009
Springer
14 years 3 days ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
IEEEARES
2010
IEEE
13 years 5 months ago
Using Smart Cards for Tamper-Proof Timestamps on Untrusted Clients
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...
Guenther Starnberger, Lorenz Froihofer, Karl M. G&...
GPC
2009
Springer
13 years 5 months ago
Dynamic Provision of Computing Resources from Grid Infrastructures and Cloud Providers
Grid computing involves the ability to harness together the power of computing resources. In this paper we push forward this philosophy and show technologies enabling federation o...
Constantino Vázquez Blanco, Eduardo Huedo, ...
COMPUTING
2007
127views more  COMPUTING 2007»
13 years 7 months ago
Analyzing a generalized Loop subdivision scheme
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
Ingo Ginkel, Georg Umlauf