Sciweavers

381 search results - page 63 / 77
» Fraction-Free RNS Algorithms for Solving Linear Systems
Sort
View
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
SGP
2003
13 years 9 months ago
Global Conformal Parameterization
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
Xianfeng Gu, Shing-Tung Yau
WLP
2005
Springer
14 years 1 months ago
Meta-S - Combining Solver Cooperation and Programming Languages
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
Stephan Frank, Petra Hofstedt, Dirk Reckmann
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...