Sciweavers

68 search results - page 10 / 14
» Impossibility Results for the Equational Theory of Timed CCS
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
EGPGV
2004
Springer
181views Visualization» more  EGPGV 2004»
14 years 28 days ago
Parallel Multiresolution Volume Rendering of Large Data Sets with Error-Guided Load Balancing
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
Chaoli Wang, Jinzhu Gao, Han-Wei Shen
JSC
2007
119views more  JSC 2007»
13 years 7 months ago
Equisingular calculations for plane curve singularities
We present an algorithm which, given a deformation with section of a reduced plane curve singularity, computes equations for the equisingularity stratum (that is, the µ-constant s...
Antonio Campillo, Gert-Martin Greuel, Christoph Lo...
SIAMSC
2010
117views more  SIAMSC 2010»
13 years 6 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...